Work

The missing log in large deviations for triangle counts

Year: 2010

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1003.3498

Author: Chatterjee, Sourav

Institutions: Courant Institute of Mathematical Sciences, New York University

Language: English

Topic: Limits and Structures in Graph Theory

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: green

Funder: National Science Foundation

Awards: Normal Approximation, Fair Allocations, Interacting Brownian Particles, and Applications, Disordered systems, dense graphs, normal approximation and applications

OpenAlex ID: W2951382025

Cites: 18

Cited by:

Related to: 20