English

Upper Tails for Cliques

Probability 2012-11-12 v2 Combinatorics

Abstract

With ξk=ξkn,p\xi_{k}=\xi_{k}^{n,p} the number of copies of KkK_k in the usual (Erd\H{o}s-R\'enyi) random graph G(n,p)G(n,p), pn2/(k1)p\geq n^{-2/(k-1)} and η>0\eta>0, we show when k>1k>1 Pr(ξk>(1+η)\Eξk)<exp[\gOη,kmin{n2pk1log(1/p),nkp(k2)}].\Pr(\xi_k> (1+\eta)\E \xi_k) < \exp [-\gO_{\eta,k} \min\{n^2p^{k-1}\log(1/p), n^kp^{\binom{k}{2}}\}]. This is tight up to the value of the constant in the exponent.

Keywords

Cite

@article{arxiv.1111.6687,
  title  = {Upper Tails for Cliques},
  author = {Bobby DeMarco and Jeff Kahn},
  journal= {arXiv preprint arXiv:1111.6687},
  year   = {2012}
}

Comments

25 pages

R2 v1 2026-06-21T19:43:00.145Z