Spectral Edge in Sparse Random Graphs: Upper and Lower Tail Large Deviations

04/01/2020
by   Bhaswar B. Bhattacharya, et al.
0

In this paper we consider the problem of estimating the joint upper and lower tail large deviations of the edge eigenvalues of an Erdős-Rényi random graph 𝒢_n,p, in the regime of p where the edge of the spectrum is no longer governed by global observables, such as the number of edges, but rather by localized statistics, such as high degree vertices. Going beyond the recent developments in mean-field approximations of related problems, this paper provides a comprehensive treatment of the large deviations of the spectral edge in this entire regime, which notably includes the well studied case of constant average degree. In particular, for r ≥ 1 fixed, we pin down the asymptotic probability that the top r eigenvalues are jointly greater/less than their typical values by multiplicative factors bigger/smaller than 1, in the regime mentioned above. The proof for the upper tail relies on a novel structure theorem, obtained by building on estimates of Krivelevich and Sudakov (2003), followed by an iterative cycle removal process, which shows, conditional on the upper tail large deviation event, with high probability the graph admits a decomposition in to a disjoint union of stars and a spectrally negligible part. On the other hand, the key ingredient in the proof of the lower tail is a Ramsey-type result which shows that if the K-th largest degree of a graph is not atypically small (for some large K depending on r), then either the top eigenvalue or the r-th largest eigenvalue is larger than that allowed by the lower tail event on the top r eigenvalues, thus forcing a contradiction. The above arguments reduce the problems to developing a large deviation theory for the extremal degrees which could be of independent interest.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/16/2021

Large deviations for the largest eigenvalue of Gaussian networks with constant average degree

Large deviation behavior of the largest eigenvalue λ_1 of Gaussian netwo...
research
02/14/2022

Upper tail behavior of the number of triangles in random graphs with constant average degree

Let N be the number of triangles in an Erdős-Rényi graph 𝒢(n,p) on n ver...
research
12/22/2021

Small deviation estimates for the largest eigenvalue of Wigner matrices

We establish precise right-tail small deviation estimates for the larges...
research
10/20/2019

Eigenvalues and Spectral Dimension of Random Geometric Graphs in Thermodynamic Regime

Network geometries are typically characterized by having a finite spectr...
research
06/13/2020

Learning Sparse Graphons and the Generalized Kesten-Stigum Threshold

The problem of learning graphons has attracted considerable attention ac...
research
11/13/2019

On the Relativized Alon Second Eigenvalue Conjecture V: Proof of the Relativized Alon Conjecture for Regular Base Graphs

This is the fifth in a series of articles devoted to showing that a typi...
research
07/12/2023

Testing Sparsity Assumptions in Bayesian Networks

Bayesian network (BN) structure discovery algorithms typically either ma...

Please sign up or login with your details

Forgot password? Click here to reset