Spectral large deviations of sparse random matrices

被引:0
作者
Ganguly, Shirshendu [1 ]
Hiesmayr, Ella [1 ]
Nam, Kyeongsik [2 ]
机构
[1] Univ Calif Berkeley, Dept Stat, Berkeley, CA 94720 USA
[2] Korea Adv Inst Sci & Technol, Dept Math Sci, Daejeon, South Korea
来源
JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES | 2024年 / 110卷 / 01期
基金
新加坡国家研究基金会;
关键词
LARGEST EIGENVALUE; WIGNER MATRICES; EDGE; PRINCIPLE; GRAPHS; PROOF;
D O I
10.1112/jlms.12954
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Eigenvalues of Wigner matrices has been a major topic of investigation. A particularly important subclass of such random matrices is formed by the adjacency matrix of an Erd & odblac;s-R & eacute;nyi graph G(n,p) equipped with i.i.d. edge-weights. An observable of particular interest is the largest eigenvalue. In this paper, we study the large deviations behavior of the largest eigenvalue of such matrices, a topic that has received considerable attention over the years. We focus on the case p=(d)/(n), where most known techniques break down. So far, results were known only for G(n),(d)/(n) without edge-weights (Krivelevich and Sudakov, '03), (Bhattacharya, Bhattacharya, and Ganguly, '21) and with Gaussian edge-weights (Ganguly and Nam, '21). In the present article, we consider the effect of general weight distributions. More specifically, we consider the entries whose tail probabilities decay at rate e(-t alpha) with alpha>0, where the regimes 0<alpha<2 and alpha>2 correspond to tails heavier and lighter than the Gaussian tail respectively. While in many natural settings the large deviations behavior is expected to depend crucially on the entry distribution, we establish a surprising and rare universal behavior showing that this is not the case when alpha>2. In contrast, in the alpha<2 case, the large deviation rate function is no longer universal and is given by the solution to a variational problem, the description of which involves a generalization of the Motzkin-Straus theorem, a classical result from spectral graph theory. As a byproduct of our large deviation results, we also establish new law of large numbers results for the largest eigenvalue. In particular, we show that the typical value of the largest eigenvalue exhibits a phase transition at alpha=2, i.e. the Gaussian distribution.
引用
收藏
页数:64
相关论文
共 35 条
[11]  
BenArous G, 1997, PROBAB THEORY REL, V108, P517
[12]   Spectral radii of sparse random matrices [J].
Benaych-Georges, Florent ;
Bordenave, Charles ;
Knowles, Antti .
ANNALES DE L INSTITUT HENRI POINCARE-PROBABILITES ET STATISTIQUES, 2020, 56 (03) :2141-2161
[13]   SPECTRAL EDGE IN SPARSE RANDOM GRAPHS: UPPER AND LOWER TAIL LARGE DEVIATIONS [J].
Bhattacharya, Bhaswar B. ;
Bhattacharya, Sohom ;
Ganguly, Shirshendu .
ANNALS OF PROBABILITY, 2021, 49 (04) :1847-1885
[14]   UPPER TAILS FOR EDGE EIGENVALUES OF RANDOM GRAPHS [J].
Bhattacharya, Bhaswar B. ;
Ganguly, Shirshendu .
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2020, 34 (02) :1069-1083
[15]   Mean quantum percolation [J].
Bordenave, Charles ;
Sen, Arnab ;
Virag, Balint .
JOURNAL OF THE EUROPEAN MATHEMATICAL SOCIETY, 2017, 19 (12) :3679-3707
[16]   Large deviations of empirical neighborhood distribution in sparse random graphs [J].
Bordenave, Charles ;
Caputo, Pietro .
PROBABILITY THEORY AND RELATED FIELDS, 2015, 163 (1-2) :149-222
[17]   A LARGE DEVIATION PRINCIPLE FOR WIGNER MATRICES WITHOUT GAUSSIAN TAILS [J].
Bordenave, Charles ;
Caputo, Pietro .
ANNALS OF PROBABILITY, 2014, 42 (06) :2454-2496
[18]   Nonlinear large deviations [J].
Chatterjee, Sourav ;
Dembo, Amir .
ADVANCES IN MATHEMATICS, 2016, 299 :396-450
[19]   The large deviation principle for the Erdos-Renyi random graph [J].
Chatterjee, Sourav ;
Varadhan, S. R. S. .
EUROPEAN JOURNAL OF COMBINATORICS, 2011, 32 (07) :1000-1017
[20]   Large deviations of subgraph counts for sparse Erdos-Renyi graphs [J].
Cook, Nicholas ;
Dembo, Amir .
ADVANCES IN MATHEMATICS, 2020, 373