The Annals of Probability · 2020 · 39 citations · 43 references
Natural SciencesMathematicsPhysicsDynamical SystemsProbability TheoryStochastic ProcessesExtreme Value TheoryMarkov ProcessesAdjacency MatricesEigenvaluesErdős - Rényi GraphsRandom Graph TheoryRandom MatricesRandom Matrix DistributionsRandom Matrix TheorySparse Random Graphs
We consider the statistics of the extreme eigenvalues of sparse random matrices, a class of random matrices that includes the normalized adjacency matrices of the Erdős–Rényi graph $G(N,p)$. Tracy–Widom fluctuations of the extreme eigenvalues for $p\gg N^{-2/3}$ was proved in (Probab. Theory Related Fields 171 (2018) 543–616; Comm. Math. Phys. 314 (2012) 587–640). We prove that there is a crossover in the behavior of the extreme eigenvalues at $p\sim N^{-2/3}$. In the case that $N^{-7/9}\ll p\ll N^{-2/3}$, we prove that the extreme eigenvalues have asymptotically Gaussian fluctuations. Under a mean zero condition and when $p=CN^{-2/3}$, we find that the fluctuations of the extreme eigenvalues are given by a combination of the Gaussian and the Tracy–Widom distribution. These results show that the eigenvalues at the edge of the spectrum of sparse Erdős–Rényi graphs are less rigid than those of random $d$-regular graphs (Bauerschmidt et al. (2019)) of the same average degree.
43
Expander graphs and their applications
Shlomo Hoory, Nathan Linial, Avi Wigderson · Bulletin of the American Mathematical Society · 2006 · 1.8K citations · Full text
E. N. Gilbert · The Annals of Mathematical Statistics · 1959 · 1.1K citations · Full text