Spectrum of Random -regular Graphs Up to the Edge
arXiv:2102.00963
Abstract
Consider the normalized adjacency matrices of random -regular graphs on vertices with fixed degree . We prove that, with probability for any , the following two properties hold as provided that : (i) The eigenvalues are close to the classical eigenvalue locations given by the Kesten-McKay distribution. In particular, the extremal eigenvalues are concentrated with polynomial error bound in , i.e. . (ii) All eigenvectors of random -regular graphs are completely delocalized.
arXiv commentUpdated version with corrected typos
References in corpus (15)
- Local semicircle law and complete delocalization for Wigner random matrices
- Universality of the local spacing distribution in certain ensembles of hermitian Wigner matrices
- Spectral Statistics of Erd{\H o}s-Rényi Graphs II: Eigenvalue Spacing and the Extreme Eigenvalues
- Expansion of Random Graphs: New Proofs, New Results
- Quantum ergodicity on large regular graphs
- Bulk universality of sparse random matrices
- Local Kesten--McKay law for random regular graphs
- Finite size correction to the spectrum of regular random graphs: an analytical solution
- Functional limit theorems for random regular graphs
- Edge rigidity and universality of random regular graphs of intermediate degree
- The Relativized Second Eigenvalue Conjecture of Alon
- Invertibility of adjacency matrices for random -regular graphs
- Exchangeable pairs, switchings, and random regular graphs
- Gaussian Waves on the Regular Tree
- Bulk eigenvalue fluctuations of sparse random matrices