Anti-concentration for subgraph counts in random graphs

  title={Anti-concentration for subgraph counts in random graphs},
  author={Jacob Fox and Matthew Kwan and Lisa Sauermann},
  journal={The Annals of Probability},
Fix a graph $H$ and some $p\in (0,1)$, and let $X_H$ be the number of copies of $H$ in a random graph $G(n,p)$. Random variables of this form have been intensively studied since the foundational work of Erdős and Renyi. There has been a great deal of progress over the years on the large-scale behaviour of $X_H$, but the more challenging problem of understanding the small-ball probabilities has remained poorly understood until now. More precisely, how likely can it be that $X_H$ falls in some… 

Figures from this paper

Local limit theorems for subgraph counts
We introduce a general framework for studying anticoncentration and local limit theorems for random variables, including graph statistics. Our methods involve an interplay between Fourier analysis,
Erdős–Littlewood–Offord problem with arbitrary probabilities
Combinatorial anti-concentration inequalities, with applications
We prove several different anti-concentration inequalities for functions of independent Bernoulli-distributed random variables. First, motivated by a conjecture of Alon, Hefetz, Krivelevich and
Number of arithmetic progressions in dense random subsets of ℤ/nℤ
We examine the behavior of the number of k-term arithmetic progressions in a random subset of Z/nZ. We prove that if a set is chosen by including each element of Z/nZ independently with constant


Upper Tail Large Deviations of Regular Subgraph Counts in Erdős‐Rényi Graphs in the Full Localized Regime
For a $\Delta$-regular connected graph ${\sf H}$ the problem of determining the upper tail large deviation for the number of copies of ${\sf H}$ in $\mathbb{G}(n,p)$, an Erd\H{o}s-R\'{e}nyi graph on
Spectral Gap of Random Hyperbolic Graphs and Related Parameters
It is established that with high probability the second smallest eigenvalue of the normalized Laplacian of the giant component of and $n-vertex random hyperbolic graph is $\Omega(n^{-(2\alpha-1)}/D)$, where $\frac12<\alpha<1$ is a model parameter and $D$ is the network diameter.
Threshold functions for small subgraphs
  • B. Bollobás
  • Mathematics, Computer Science
    Mathematical Proceedings of the Cambridge Philosophical Society
  • 1981
In this note, random labelled graphs are studied by the set of all graphs with n given labelled vertices and M(n) edges by turning (M(n)) into a probability space by giving all graphs the same probability.
Survival and extinction of epidemics on random graphs with general degree
In this paper, we establish the necessary and sufficient criterion for the contact process on Galton-Watson trees (resp. random graphs) to exhibit the phase of extinction (resp. short survival). We
A Local Limit Theorem for Cliques in G(n,p)
We prove a local limit theorem the number of $r$-cliques in $G(n,p)$ for $p\in(0,1)$ and $r\ge 3$ fixed constants. Our bounds hold in both the $\ell^\infty$ and $\ell^1$ metric. The main work of the
Spectral techniques applied to sparse random graphs
  • U. Feige, E. Ofek
  • Mathematics, Computer Science
    Random Struct. Algorithms
  • 2005
The eigenvalue gap for the adjacency matrices of sparse random graphs is analyzed and it is shown that by removing a small number of vertices of highest degree in G, one gets a graph G′ for which $\lambda = O(\sqrt{d})$.
The diameter of KPKVB random graphs
Here it is shown the maximum diameter over all components is a.a.s. $O(\log N),$ thus giving a bound that is tight up to a multiplicative constant.
Subgraph counts in random graphs using incomplete u-statistics methods
When are small subgraphs of a random graph normally distributed
A random graph K(n, p) is a graph on the vertex set {1 . . . . . n} whose edges appear independently from each other and with probability p=p(n). One of the classical questions qf the theory of
Subgraph Counts and Containment Probabilities of Balanced and Unbalanced Subgraphs in a Large Random Graph a
Let Kns denote the random graph on n labeled vertices in which each of the (1) possible edges of K,, the complete graph on n vertices, is present independently with probability p , 0 5 p s 1. Since