Abstract
In this paper, we investigate the spectral properties of the adjacency and the Laplacian matrices of random graphs. We prove that: (i) the law of large numbers for the spectral norms and the largest eigenvalues of the adjacency and the Laplacian matrices; (ii) under some further independent conditions, the normalized largest eigenvalues of the Laplacian matrices are dense in a compact interval almost surely; (iii) the empirical distributions of the eigenvalues of the Laplacian matrices converge weakly to the free convolution of the standard Gaussian distribution and the Wigner's semi-circular law; (iv) the empirical distributions of the eigenvalues of the adjacency matrices converge weakly to the Wigner's semi-circular law.
Original language | English (US) |
---|---|
Pages (from-to) | 2086-2117 |
Number of pages | 32 |
Journal | Annals of Applied Probability |
Volume | 20 |
Issue number | 6 |
DOIs | |
State | Published - Dec 2010 |
Keywords
- Adjacency matrix
- Free convolution
- Laplacian matrix
- Largest eigenvalue
- Random graph
- Random matrix
- Semi-circle law
- Spectral distribution