The missing log in large deviations for triangle counts
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. (c) 2011 Wiley Periodicals, Inc. Random Struct. Alg., 40, 437451, 2012
large deviations erdos-renyi random graph tail bound concentration inequalities