English

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

Probability 2020-06-01 v3 Mathematical Physics math.MP

Abstract

We complete the analysis of the extremal eigenvalues of the the adjacency matrix AA of the Erd\H{o}s-R\'enyi graph G(N,d/N)G(N,d/N) in the critical regime dlogNd \asymp \log N of the transition uncovered in [arXiv:1704.02953,arXiv:1704.02945], where the regimes dlogNd \gg \log N and dlogNd \ll \log N were studied. We establish a one-to-one correspondence between vertices of degree at least 2d2d and nontrivial (excluding the trivial top eigenvalue) eigenvalues of A/dA / \sqrt{d} outside of the asymptotic bulk [2,2][-2,2]. This correspondence implies that the transition characterized by the appearance of the eigenvalues outside of the asymptotic bulk takes place at the critical value d=d=1log41logNd = d_* = \frac{1}{\log 4 - 1} \log N. For d<dd < d_* we obtain rigidity bounds on the locations of all eigenvalues outside the interval [2,2][-2,2], and for d>dd > d_* we show that no such eigenvalues exist. All of our estimates are quantitative with polynomial error probabilities. Our proof is based on a tridiagonal representation of the adjacency matrix and on a detailed analysis of the geometry of the neighbourhood of the large degree vertices. An important ingredient in our estimates is a matrix inequality obtained via the associated nonbacktracking matrix and an Ihara-Bass formula [arXiv:1704.02945]. Our argument also applies to sparse Wigner matrices, defined as the Hadamard product of AA and a Wigner matrix, in which case the role of the degrees is replaced by the squares of the 2\ell^2-norms of the rows.

Keywords

Cite

@article{arxiv.1905.03243,
  title  = {Extremal eigenvalues of critical Erd\H{o}s-R\'enyi graphs},
  author = {Johannes Alt and Raphaël Ducatez and Antti Knowles},
  journal= {arXiv preprint arXiv:1905.03243},
  year   = {2020}
}

Comments

55 pages, 5 figures. We corrected some typos and small inconsistencies