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

DOI10.1007/s00440-022-01164-7zbMath1501.60024arXiv2102.08364OpenAlexW4307716622MaRDI QIDQ2099809

Shirshendu Ganguly, Kyeongsik Nam

Publication date: 18 November 2022

Published in: Probability Theory and Related Fields (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2102.08364

zbMATH Keywords

large deviationlower tail probabilitiesupper tail probabilities

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Random matrices (probabilistic aspects) (60B20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Large deviations (60F10)

Related Items (1)

Upper tail of the spectral radius of sparse Erdös-Rényi graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Large deviations principle for the largest eigenvalue of Wigner matrices without Gaussian tails
• Sharp nonasymptotic bounds on the norm of random matrices with independent entries
• Spectral statistics of Erdős-Rényi graphs. I: Local semicircle law
• A large deviation principle for Wigner matrices without Gaussian tails
• The large deviation principle for the Erdős-Rényi random graph
• Spectral statistics of Erdős-Rényi graphs II: eigenvalue spacing and the extreme eigenvalues
• Large deviations of empirical neighborhood distribution in sparse random graphs
• Large deviations for the largest eigenvalue of Rademacher matrices
• Large deviations for Wigner's law and Voiculescu's non-commutative entropy
• The dimension-free structure of nonhomogeneous random matrices
• Gaussian-width gradient complexity, reverse log-Sobolev inequalities and nonlinear large deviations
• Mean quantum percolation
• Extremal eigenvalues of critical Erdős-Rényi graphs
• Spectral edge in sparse random graphs: upper and lower tail large deviations
• Upper tails via high moments and entropic stability
• The structure of low-complexity Gibbs measures on product spaces
• Nonlinear large deviations: beyond the hypercube
• Large deviations of subgraph counts for sparse Erdős-Rényi graphs
• Nonlinear large deviation bounds with applications to Wigner matrices and sparse Erdős-Rényi graphs
• Spectral radii of sparse random matrices
• Universality of the mean-field for the Potts model
• Upper tails and independence polynomials in random graphs
• Largest eigenvalues of sparse inhomogeneous Erdős-Rényi graphs
• Nonlinear large deviations
• Large deviations for the largest eigenvalue of sub-Gaussian matrices
• Large Deviations for Random Matrices
• Superconcentration and Related Topics
• Introduction to Random Graphs
• On replica symmetry of large deviations in random graphs
• The Expected Norm of Random Matrices
• Some estimates of norms of random matrices
• The Largest Eigenvalue of Sparse Random Graphs
• Proof of the Van den Berg–Kesten Conjecture
• Upper Tails for Edge Eigenvalues of Random Graphs
• Maxima for Graphs and a New Proof of a Theorem of Turán
• On the spectral norm of Gaussian random matrices
• On the variational problem for upper tails in sparse random graphs
• Aging of spherical spin glasses

This page was built for publication: Large deviations for the largest eigenvalue of Gaussian networks with constant average degree