The missing log in large deviations for triangle counts
Probability
2011-04-13 v3 Combinatorics
Abstract
This paper solves the problem of sharp large deviation estimates for the upper tail of the number of triangles in an Erdos-Renyi random graph, by establishing a logarithmic factor in the exponent that was missing till now. It is possible that the method of proof may extend to general subgraph counts.
Cite
@article{arxiv.1003.3498,
title = {The missing log in large deviations for triangle counts},
author = {Sourav Chatterjee},
journal= {arXiv preprint arXiv:1003.3498},
year = {2011}
}
Comments
15 pages. Title changed. To appear in Random Structures Algorithms