Anti-concentration for subgraph counts in random graphs
From MaRDI portal
Publication:2039444
DOI10.1214/20-AOP1490zbMath1467.05242arXiv1905.12749OpenAlexW3143023837MaRDI QIDQ2039444
Lisa Sauermann, Jacob Fox, Matthew Kwan
Publication date: 2 July 2021
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.12749
Related Items (3)
Local limit theorems for subgraph counts ⋮ Combinatorial anti-concentration inequalities, with applications ⋮ Number of arithmetic progressions in dense random subsets of \(\mathbb{Z}/n\mathbb{Z}\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of Stein's method
- When are small subgraphs of a random graph normally distributed?
- Subgraph counts in random graphs using incomplete U-statistics methods
- Limit theorems for complete subgraphs of random graphs
- A central limit theorem for decomposable random variables with applications to random graphs
- Gaussian-width gradient complexity, reverse log-Sobolev inequalities and nonlinear large deviations
- Triangles in random graphs
- 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
- Modular statistics for subgraph counts in sparse random graphs
- The Littlewood-Offord problem in high dimensions and a conjecture of Frankl and Füredi
- Large deviations for random graphs. École d'Été de Probabilités de Saint-Flour XLV -- 2015
- Upper tails and independence polynomials in random graphs
- Nonlinear large deviations
- Anti-concentration for polynomials of independent random variables
- Graph Decomposition and Parity
- Threshold functions for small subgraphs
- Poisson convergence and random graphs
- Estimates for the concentration function of combinatorial number theory and probability
- Combinatorial anti-concentration inequalities, with applications
- Random graphs and the parity quantifier
- Small Ball Probability, Inverse Theorems, and Applications
- A short proof of Sperner's lemma
- On the variational problem for upper tails in sparse random graphs
- A local central limit theorem for triangles in a random graph
- On a lemma of Littlewood and Offord
This page was built for publication: Anti-concentration for subgraph counts in random graphs
