A local central limit theorem for triangles in a random graph

作者：Gilmer Justin^*; Kopparty Swastik

来源：Random Structures and Algorithms, 2016, 48(4): 732-750.

DOI：10.1002/rsa.20604

• Random Graphs
• local limit theorem
• subgraph counts
• characteristic function

In this paper, we prove a local limit theorem for the distribution of the number of triangles in the Erdos-Renyi random graph G(n, p), where p(0,1) is a fixed constant. Our proof is based on bounding the characteristic t) of the number of triangles, and uses several different conditioning arguments for handling different ranges of t.

• 出版日期2016-7
• 单位rutgers