Spectral statistics of Erdős-Rényi graphs II: Eigenvalue spacing and the extreme eigenvalues
László Erdös
Knowles, Antti
Yau, Horng-Tzer
Yin, Jun
We consider the ensemble of adjacency matrices of Erdős-Rényi random graphs, i.e. graphs on N vertices where every edge is chosen independently and with probability p ≡ p(N). We rescale the matrix so that its bulk eigenvalues are of order one. Under the assumption pN≫N2/3 , we prove the universality of eigenvalue distributions both in the bulk and at the edge of the spectrum. More precisely, we prove (1) that the eigenvalue spacing of the Erdős-Rényi graph in the bulk of the spectrum has the same distribution as that of the Gaussian orthogonal ensemble; and (2) that the second largest eigenvalue of the Erdős-Rényi graph has the same distribution as the largest eigenvalue of the Gaussian orthogonal ensemble. As an application of our method, we prove the bulk universality of generalized Wigner matrices under the assumption that the matrix entries have at least 4 + ε moments.
Springer
2012
info:eu-repo/semantics/article
doc-type:article
text
http://purl.org/coar/resource_type/c_6501
https://research-explorer.app.ist.ac.at/record/2776
Erdös L, Knowles A, Yau H, Yin J. Spectral statistics of Erdős-Rényi graphs II: Eigenvalue spacing and the extreme eigenvalues. <i>Communications in Mathematical Physics</i>. 2012;314(3):587-640. doi:<a href="https://doi.org/10.1007/s00220-012-1527-7">10.1007/s00220-012-1527-7</a>
info:eu-repo/semantics/altIdentifier/doi/10.1007/s00220-012-1527-7
info:eu-repo/semantics/closedAccess