Upper tail of the spectral radius of sparse Erd\H{o}s-R\'{e}nyi graphs
Anirban Basak

TL;DR
This paper investigates the large deviation probabilities of the largest eigenvalue in sparse Erdős-Rényi graphs, revealing phase transitions and typical structures conditioned on these rare events across different regimes of edge probability.
Contribution
It characterizes the upper tail large deviations of the spectral radius in sparse Erdős-Rényi graphs, identifying phase transitions and the typical structures conditioned on these deviations.
Findings
For p ≫ n^{-2/3}, upper tail probability matches that of planting a clique.
For p ≪ n^{-2/3}, upper tail probability is driven by high degree vertices.
The large deviation probabilities are asymptotically described by a mean-field variational problem.
Abstract
We consider an Erd\H{o}s-R\'{e}nyi graph on vertices with edge probability such that \[ \sqrt{\frac{\log n}{\log \log n}} \ll np \le n^{1/2-o(1)}, \label{eq:abs} \tag{} \] and derive the upper tail large deviations of , the largest eigenvalue of its adjacency matrix. Within this regime we show that, for the -probability of the upper tail event of equals to that of planting a clique of an appropriate size (upon ignoring smaller order terms), while for the same is given by that of the existence of a high degree vertex. This, in particular, shows an emergence of {\em non-planted localized structure} in the latter regime. We also confirm that in the entire regime \eqref{eq:abs} the large deviation probability is asymptotically approximated by the solution of the…
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.
Taxonomy
TopicsRandom Matrices and Applications · advanced mathematical theories · Stochastic processes and statistical mechanics
