# Transition from Tracy–Widom to Gaussian fluctuations of extremal eigenvalues of sparse Erdős–Rényi graphs

@article{Huang2020TransitionFT,
title={Transition from Tracy–Widom to Gaussian fluctuations of extremal eigenvalues of sparse Erdős–R{\'e}nyi graphs},
author={Jiaoyang Huang and Benjamin Landon and H. T. Yau},
journal={The Annals of Probability},
year={2020}
}
• Published 11 December 2017
• Mathematics
• The Annals of Probability
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\H{o}s-R\'enyi graph $G(N,p)$. Tracy-Widom fluctuations of the extreme eigenvalues for $p\gg N^{-2/3}$ was proved in [17,46]. 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…

## Figures from this paper

### Local law and Tracy–Widom limit for sparse sample covariance matrices

• Mathematics
The Annals of Applied Probability
• 2019
We consider spectral properties of sparse sample covariance matrices, which includes biadjacency matrices of the bipartite Erd\H{o}s-R\'enyi graph model. We prove a local law for the eigenvalue

### Bulk eigenvalue fluctuations of sparse random matrices

• Yukun He
• Mathematics
The Annals of Applied Probability
• 2020
We consider a class of sparse random matrices, which includes the adjacency matrix of Erdős-Renyi graphs $\mathcal G(N,p)$ for $p \in [N^{\varepsilon-1},N^{-\varepsilon}]$. We identify the joint

### Extremal eigenvalues of critical Erd\H{o}s-R\'enyi graphs

• Mathematics
• 2019
We complete the analysis of the extremal eigenvalues of the the adjacency matrix $A$ of the Erdős-Renyi graph $G(N,d/N)$ in the critical regime $d \asymp \log N$ of the transition uncovered in

### Extremal eigenvalues of critical Erdős–Rényi graphs

• Mathematics
• 2021
We complete the analysis of the extremal eigenvalues of the adjacency matrix A of the Erdős-Rényi graph G(N, d/N) in the critical regime d log N of the transition uncovered in [2, 3], where the

### Dyson equation and eigenvalue statistics of random matrices

The eigenvalue density of many large random matrices is well approximated by a deterministic measure, the \emph{self-consistent density of states}. In the present work, we show this behaviour for

### Local law and complete eigenvector delocalization for supercritical Erdős–Rényi graphs

• Computer Science, Mathematics
The Annals of Probability
• 2019
A key ingredient of the proof is a new family of multilinear large deviation estimates for sparse random vectors, which carefully balance mixed $\ell^2$ and $\ell\infty$ norms of the coefficients with combinatorial factors, allowing us to prove strong enough concentration down to the critical scale $pN = O(\log N)$.

### Edge rigidity and universality of random regular graphs of intermediate degree

• Mathematics
• 2019
For random $d$-regular graphs on $N$ vertices with $1 \ll d \ll N^{2/3}$, we develop a $d^{-1/2}$ expansion of the local eigenvalue distribution about the Kesten-McKay law up to order $d^{-3}$. This

### Higher order fluctuations of extremal eigenvalues of sparse random matrices

We consider extremal eigenvalues of sparse random matrices, a class of random matrices including the adjacency matrices of Erdős-Rényi graphs G(N, p). Recently, it was shown that the leading order

• Mathematics
• 2019