The upper tail problem for induced 4‐cycles in sparse random graphs

DOI10.1002/rsa.21187arXiv2201.02970OpenAlexW4387671753MaRDI QIDQ6119225

Asaf Cohen Antonir

Publication date: 29 February 2024

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

random graphsupper tailnonlinear large deviations

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Combinatorial probability (60C05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Density (toughness, etc.) (05C42)

Cites Work

• Unnamed Item
• Unnamed Item
• The large deviation principle for the Erdős-Rényi random graph
• Large deviations techniques and applications.
• The maximal number of induced complete bipartite graphs
• When are small subgraphs of a random graph normally distributed?
• On the number of subgraphs of prescribed type of graphs with a given number of edges
• On the number of copies of one hypergraph in another
• Gaussian-width gradient complexity, reverse log-Sobolev inequalities and nonlinear large deviations
• Upper tails for subgraph counts in random graphs
• A transportation approach to the mean-field approximation
• 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 tails and independence polynomials in random graphs
• Nonlinear large deviations
• 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
• On the variational problem for upper tails in sparse random graphs
• On the maximum number of copies of H in graphs with given size and order
• On the upper tail problem for random hypergraphs

This page was built for publication: The upper tail problem for induced 4‐cycles in sparse random graphs