The missing log in large deviations for triangle counts
classification
🧮 math.PR
math.CO
keywords
countslargemissingdeviationdeviationserdos-renyiestablishingestimates
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.