Nonlinear large deviation bounds with applications to Wigner matrices and sparse Erdős-Rényi graphs

DOI10.1214/20-AOP1427zbMath1456.60063arXiv1810.01558OpenAlexW3088535225MaRDI QIDQ2212598

Fanny Augeri

Publication date: 24 November 2020

Published in: The Annals of Probability (Search for Journal in Brave)

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

zbMATH Keywords

large deviationsWigner matricesconvex analysismean-field approximationErdős-Rényi graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Random matrices (probabilistic aspects) (60B20) Inequalities and extremum problems involving convexity in convex geometry (52A40) Large deviations (60F10) Random matrices (algebraic aspects) (15B52)

Related Items (18)

Rare event asymptotics for exploration processes for random graphs ⋮ Large deviations for the largest eigenvalue of matrices with variance profiles ⋮ Upper tails via high moments and entropic stability ⋮ Replica symmetry in upper tails of mean-field hypergraphs ⋮ Upper tail of the spectral radius of sparse Erdös-Rényi graphs ⋮ Upper tail for homomorphism counts in constrained sparse random graphs ⋮ Bernoulli random matrices ⋮ Lower tails via relative entropy ⋮ Rare events in random matrix theory ⋮ The upper tail problem for induced 4‐cycles in sparse random graphs ⋮ Large deviations in random latin squares ⋮ Upper Tail Large Deviations of Regular Subgraph Counts in Erdős‐Rényi Graphs in the Full Localized Regime ⋮ Typical large graphs with given edge and triangle densities ⋮ Local convexity of the TAP free energy and AMP convergence for \(\mathbb{Z}_2\)-synchronization ⋮ A transportation approach to the mean-field approximation ⋮ Anti-concentration for subgraph counts in random graphs ⋮ Spectral edge in sparse random graphs: upper and lower tail large deviations ⋮ Large deviations for the largest eigenvalue of Gaussian networks with constant average degree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The large deviation principle for the Erdős-Rényi random graph
• Large deviations for the largest eigenvalue of Rademacher matrices
• Spectral analysis of large dimensional random matrices
• Large deviations techniques and applications.
• Concentration of the spectral measure for large matrices
• The dimension-free structure of nonhomogeneous random matrices
• Gaussian-width gradient complexity, reverse log-Sobolev inequalities and nonlinear large deviations
• On the large deviations of traces of random matrices
• Upper tails for subgraph counts in random graphs
• 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
• Universality of the mean-field for the Potts model
• Upper tails and independence polynomials in random graphs
• Lectures on probability theory and statistics. Ecole d'été de probabilités de Saint-Flour XXIV -- 1994. Lectures given at the summer school in Saint-Flour, France, July 7--23, 1994
• Nonlinear large deviations
• On the Choice Number of Random Hypergraphs
• The lower tail: Poisson approximation revisited
• The missing log in large deviations for triangle counts
• Upper tails for triangles
• Functional Analysis, Calculus of Variations and Optimal Control
• Tight upper tail bounds for cliques
• An Introduction to Random Matrices
• Divide and conquer martingales and the number of triangles in a random graph
• Mean-field approximation, convex hierarchies, and the optimality of correlation rounding: a unified perspective
• A counterexample to the DeMarco‐Kahn upper tail conjecture
• Asymptotic Geometric Analysis, Part I
• On the variational problem for upper tails in sparse random graphs

This page was built for publication: Nonlinear large deviation bounds with applications to Wigner matrices and sparse Erdős-Rényi graphs