pith. sign in

arxiv: 1011.2608 · v1 · pith:A3B3Y4YKnew · submitted 2010-11-11 · 🧮 math.PR

Spectral distributions of adjacency and Laplacian matrices of random graphs

classification 🧮 math.PR
keywords matriceslaplacianadjacencyeigenvaluesdistributionsspectralconvergeempirical
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.