Extremal eigenvalues of critical Erdos-R\'enyi graphs

Abstract

We complete the analysis of the extremal eigenvalues of the the adjacency matrix A of the Erdos-R\'enyi graph G(N,d/N) in the critical regime d N of the transition uncovered in [arXiv:1704.02953,arXiv:1704.02945], where the regimes d N and d N were studied. We establish a one-to-one correspondence between vertices of degree at least 2d and nontrivial (excluding the trivial top eigenvalue) eigenvalues of A / d outside of the asymptotic bulk [-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* = 1 4 - 1 N. For d < d* we obtain rigidity bounds on the locations of all eigenvalues outside the interval [-2,2], and for d > 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 A and a Wigner matrix, in which case the role of the degrees is replaced by the squares of the 2-norms of the rows.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…