Name
Abstract | ||
|---|---|---|
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 function (t) of the number of triangles, and uses several different conditioning arguments for handling different ranges of t. (c) 2016 Wiley Periodicals, Inc. Random Struct. Alg., 48, 732-750, 2016 |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1002/rsa.20604 | RANDOM STRUCTURES & ALGORITHMS |
Keywords | Field | DocType |
Random Graphs,local limit theorem,subgraph counts,characteristic function | Perfect graph,Random regular graph,Discrete mathematics,Combinatorics,Central limit theorem,Random graph,Characteristic function (probability theory),struct,Nested triangles graph,Mathematics,Bounding overwatch | Journal |
Volume | Issue | ISSN |
48.0 | 4.0 | 1042-9832 |
Citations | PageRank | References |
1 | 0.35 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| justin gilmer | 1 | 375 | 16.71 |
| Swastik Kopparty | 2 | 384 | 32.89 |