English

Upper tails for triangles

Probability 2011-11-30 v2 Combinatorics

Abstract

With ξ\xi the number of triangles in the usual (Erd\H{o}s-R\'enyi) random graph G(m,p)G(m,p), p>1/mp>1/m and η>0\eta>0, we show (for some Cη>0C_{\eta}>0) Pr(ξ>(1+η)\Eξ)<exp[Cηminm2p2log(1/p),m3p3].\Pr(\xi> (1+\eta)\E \xi) < \exp[-C_{\eta}\min{m^2p^2\log(1/p),m^3p^3}]. This is tight up to the value of CηC_{\eta}.

Keywords

Cite

@article{arxiv.1005.4471,
  title  = {Upper tails for triangles},
  author = {Bobby DeMarco and Jeff Kahn},
  journal= {arXiv preprint arXiv:1005.4471},
  year   = {2011}
}

Comments

10 pages

R2 v1 2026-06-21T15:27:18.215Z