Rooted trees and moments of large sparse random matrices
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AC, Discrete Random Walks (DRW'03), DMTCS Proceedings vol. AC, Discrete Random Walks (DRW'03) (2003)
Cet article a éte moissonné depuis la source Episciences
In these expository paper we describe the role of the rooted trees as a base for convenient tools in studies ofrandom matrices. Regarding the Wigner ensemble of random matrices, we represent main ingredients ofthis approach. Also werefine our previous result on the limit of the spectral norm of adjacency matrix of large random graphs.
@article{DMTCS_2003_special_248_a26,
author = {Khorunzhiy, Oleksiy},
title = {Rooted trees and moments of large sparse random matrices},
journal = {Discrete mathematics & theoretical computer science},
year = {2003},
volume = {DMTCS Proceedings vol. AC, Discrete Random Walks (DRW'03)},
doi = {10.46298/dmtcs.3346},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3346/}
}
TY - JOUR AU - Khorunzhiy, Oleksiy TI - Rooted trees and moments of large sparse random matrices JO - Discrete mathematics & theoretical computer science PY - 2003 VL - DMTCS Proceedings vol. AC, Discrete Random Walks (DRW'03) UR - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3346/ DO - 10.46298/dmtcs.3346 LA - en ID - DMTCS_2003_special_248_a26 ER -
%0 Journal Article %A Khorunzhiy, Oleksiy %T Rooted trees and moments of large sparse random matrices %J Discrete mathematics & theoretical computer science %D 2003 %V DMTCS Proceedings vol. AC, Discrete Random Walks (DRW'03) %U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3346/ %R 10.46298/dmtcs.3346 %G en %F DMTCS_2003_special_248_a26
Khorunzhiy, Oleksiy. Rooted trees and moments of large sparse random matrices. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AC, Discrete Random Walks (DRW'03), DMTCS Proceedings vol. AC, Discrete Random Walks (DRW'03) (2003). doi: 10.46298/dmtcs.3346
Cité par Sources :