Answers are grounded in this paper and cite their sources.
In this paper, we prove a local limit theorem for the distribution of the number of triangles in the Erdos-Rényi random graph G(n, p), where is a fixed constant. Our proof is based on bounding the characteristic function of the number of triangles, and uses several different conditioning arguments for handling different ranges of t.
No takes yet. Share an insight, caveat, or question.
Gilmer et al. (2016) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: