On the variational problem for upper tails in sparse random graphs
From MaRDI portal
Publication:5739097
DOI10.1002/rsa.20658zbMath1364.05063arXiv1402.6011OpenAlexW3105635524MaRDI QIDQ5739097
Publication date: 2 June 2017
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.6011
Related Items (38)
Rare event asymptotics for exploration processes for random graphs ⋮ Gaussian-width gradient complexity, reverse log-Sobolev inequalities and nonlinear large deviations ⋮ A detailed investigation into near degenerate exponential random graphs ⋮ Upper tails via high moments and entropic stability ⋮ Large deviation for uniform graphs with given degrees ⋮ Upper tails and independence polynomials in random graphs ⋮ Localization in random geometric graphs with too many edges ⋮ Replica symmetry in upper tails of mean-field hypergraphs ⋮ The structure of low-complexity Gibbs measures on product spaces ⋮ Upper tail of the spectral radius of sparse Erdös-Rényi graphs ⋮ On the upper tail problem for random hypergraphs ⋮ Upper tail for homomorphism counts in constrained sparse random graphs ⋮ Large deviations for subcomplex counts and Betti numbers in multiparameter simplicial complexes ⋮ Moderate deviations in cycle count ⋮ Upper Tails for Edge Eigenvalues of Random Graphs ⋮ Lower tails via relative entropy ⋮ Nonlinear large deviations: beyond the hypercube ⋮ The upper tail problem for induced 4‐cycles in sparse random graphs ⋮ Upper Tail Large Deviations of Regular Subgraph Counts in Erdős‐Rényi Graphs in the Full Localized Regime ⋮ Large deviations of subgraph counts for sparse Erdős-Rényi graphs ⋮ Asymptotic Structure of Graphs with the Minimum Number of Triangles ⋮ On the Lower Tail Variational Problem for Random Graphs ⋮ Nonlinear large deviation bounds with applications to Wigner matrices and sparse Erdős-Rényi graphs ⋮ Upper Tail Bounds for Cycles ⋮ Moderate deviations of subgraph counts in the Erdős-Rényi random graphs 𝐺(𝑛,𝑚) and 𝐺(𝑛,𝑝) ⋮ Concentration inequalities for non-Lipschitz functions with bounded derivatives of higher order ⋮ A large deviation principle for the Erdős-Rényi uniform random graph ⋮ Decomposition of mean-field Gibbs distributions into product measures ⋮ Phase transitions in edge-weighted exponential random graphs: near-degeneracy and universality ⋮ Preferential attachment when stable ⋮ Anti-concentration for subgraph counts in random graphs ⋮ Spectral edge in sparse random graphs: upper and lower tail large deviations ⋮ A counterexample to the DeMarco‐Kahn upper tail conjecture ⋮ Upper tail bounds for stars ⋮ Regular graphs with many triangles are structured ⋮ Modified log-Sobolev inequalities, Beckner inequalities and moment estimates ⋮ Large deviations for the largest eigenvalue of Gaussian networks with constant average degree ⋮ Ground states for exponential random graphs
Cites Work
- Unnamed Item
- The large deviation principle for the Erdős-Rényi random graph
- Limits of dense graph sequences
- Szemerédi's lemma for the analyst
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Quick approximation to matrices and applications
- A generalization of Hölder's inequality and some probability inequalities
- Upper tails for subgraph counts in random graphs
- Upper tails and independence polynomials in random graphs
- The deletion method for upper tail estimates
- On the Choice Number of Random Hypergraphs
- The missing log in large deviations for triangle counts
- Upper tails for triangles
- Tight upper tail bounds for cliques
- On replica symmetry of large deviations in random graphs
- Divide and conquer martingales and the number of triangles in a random graph
- The infamous upper tail
This page was built for publication: On the variational problem for upper tails in sparse random graphs
