Upper tail bounds for stars

DOI10.37236/8493zbMath1435.05183arXiv1901.10637OpenAlexW2918847771MaRDI QIDQ2309238

Matas Šileikis, Lutz Warnke

Publication date: 30 March 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

binomial random graph\(r\)-armed stars

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Large deviations (60F10)

Related Items (7)

Upper tails via high moments and entropic stability ⋮ The jump of the clique chromatic number of random graphs ⋮ Bounds on Ramsey games via alterations ⋮ 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 ⋮ Upper Tail Bounds for Cycles ⋮ On the missing log in upper tail estimates

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the upper tail of counts of strictly balanced subgraphs
• The large deviation principle for the Erdős-Rényi random graph
• Subhypergraph counts in extremal and random hypergraphs and the fractional \(q\)-independence
• When are small subgraphs of a random graph normally distributed?
• Gaussian-width gradient complexity, reverse log-Sobolev inequalities and nonlinear large deviations
• Upper tails for arithmetic progressions in random subsets
• Upper tails for subgraph counts in random graphs
• Upper tails and independence polynomials in random graphs
• Upper tails for counting objects in randomly induced subhypergraphs and rooted random graphs
• The deletion method for upper tail estimates
• Nonlinear large deviations
• Counting extensions
• 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
• Tight upper tail bounds for cliques
• On replica symmetry of large deviations in random graphs
• Threshold functions for small subgraphs
• Poisson approximation for large deviations
• The infamous upper tail
• The Janson inequalities for general up‐sets
• A counterexample to the DeMarco‐Kahn upper tail conjecture
• On the Method of Typical Bounded Differences
• On the variational problem for upper tails in sparse random graphs
• Concentration of multivariate polynomials and its applications

This page was built for publication: Upper tail bounds for stars