Nonlinear large deviations: beyond the hypercube

DOI10.1214/19-AAP1516zbMath1464.60026arXiv1703.08887MaRDI QIDQ2192741

Jun Yan

Publication date: 17 August 2020

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

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

zbMATH Keywords

random graphslarge deviationsmean-fieldvector spin models

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05) Large deviations (60F10)

Related Items (9)

Upper tail of the spectral radius of sparse Erdös-Rényi graphs ⋮ Upper tail for homomorphism counts in constrained sparse random graphs ⋮ Large deviations for subcomplex counts and Betti numbers in multiparameter simplicial complexes ⋮ Local convexity of the TAP free energy and AMP convergence for \(\mathbb{Z}_2\)-synchronization ⋮ Multi-variate correlation and mixtures of product measures ⋮ Nonlinear large deviation bounds with applications to Wigner matrices and sparse Erdős-Rényi graphs ⋮ A transportation approach to the mean-field approximation ⋮ 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
• Calculus on normed vector spaces
• Asymptotics of mean-field \(\mathrm{O}(N)\) models
• The large deviation principle for the Erdős-Rényi random graph
• Edge-colored complete graphs with precisely colored subgraphs
• Large deviations techniques and applications.
• Gaussian-width gradient complexity, reverse log-Sobolev inequalities and nonlinear large deviations
• Upper tails for subgraph counts in random graphs
• Decompositions of edge-colored complete graphs
• The structure of low-complexity Gibbs measures on product spaces
• Universality of the mean-field for the Potts model
• Paths and trails in edge-colored graphs
• Upper tails and independence polynomials in random graphs
• Nonlinear large deviations
• An introduction to large deviations for random graphs
• Tight upper tail bounds for cliques
• Divide and conquer martingales and the number of triangles in a random graph
• On the variational problem for upper tails in sparse random graphs

This page was built for publication: Nonlinear large deviations: beyond the hypercube