Spectral Statistics of Erd os-R\'enyi Graphs II: Eigenvalue Spacing and the Extreme Eigenvalues
Abstract
We consider the ensemble of adjacency matrices of Erd os-R\'enyi 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 p N 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 os-R\'enyi 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 os-R\'enyi 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.