Spectral statistics of Erd\H{o}s-R\'{e}nyi graphs I: Local semicircle law
L\'aszl\'o Erd\H{o}s, Antti Knowles, Horng-Tzer Yau, Jun Yin

TL;DR
This paper proves that the eigenvalue distribution of Erdős-Rényi graphs follows the semicircle law under certain conditions, and shows that eigenvectors are delocalized, with results applicable to spectral universality in a companion study.
Contribution
It establishes the local semicircle law for Erdős-Rényi graphs with sparse regimes and eigenvector delocalization, advancing understanding of spectral properties in random graph models.
Findings
Eigenvalue density follows the semicircle law for pN→∞.
Eigenvectors are completely delocalized with high probability.
Results support spectral universality in a subsequent paper.
Abstract
We consider the ensemble of adjacency matrices of Erd\H{o}s-R\'{e}nyi random graphs, that is, graphs on vertices where every edge is chosen independently and with probability . We rescale the matrix so that its bulk eigenvalues are of order one. We prove that, as long as (with a speed at least logarithmic in ), the density of eigenvalues of the Erd\H{o}s-R\'{e}nyi ensemble is given by the Wigner semicircle law for spectral windows of length larger than (up to logarithmic corrections). As a consequence, all eigenvectors are proved to be completely delocalized in the sense that the -norms of the -normalized eigenvectors are at most of order with a very high probability. The estimates in this paper will be used in the companion paper [Spectral statistics of Erd\H{o}s-R\'{e}nyi graphs II: Eigenvalue spacing and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
