Upper Tail Large Deviations of Regular Subgraph Counts in Erdős‐Rényi Graphs in the Full Localized Regime
From MaRDI portal
Publication:6139107
DOI10.1002/cpa.22036zbMath1530.05189arXiv1912.11410OpenAlexW4200072088MaRDI QIDQ6139107
Riddhipratim Basu, Anirban Basak
Publication date: 16 January 2024
Published in: Communications on Pure and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.11410
Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Large deviations (60F10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- The large deviation principle for the Erdős-Rényi random graph
- Matching theory
- Gaussian-width gradient complexity, reverse log-Sobolev inequalities and nonlinear large deviations
- Upper tails for subgraph counts in random graphs
- The structure of low-complexity Gibbs measures on product spaces
- 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
- Upper tail bounds for stars
- Upper tails and independence polynomials in random graphs
- Nonlinear large deviations
- 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
- Upper Tails for Edge Eigenvalues of Random Graphs
- Upper Tail Bounds for Cycles
- A counterexample to the DeMarco‐Kahn upper tail conjecture
- On the variational problem for upper tails in sparse random graphs
- A textbook of graph theory
- On the upper tail problem for random hypergraphs
- Upper tail for homomorphism counts in constrained sparse random graphs
