Name
Abstract | ||
|---|---|---|
We obtain the asymptotic distribution of the number of copies of a fixed subgraph H in a random d-regular graph, provided H is strictly balanced and d = d(n) is chosen so that the expected number of copies of H tends to infinity (but not too quickly), and the expected number of copies sharing edges with two other copies is bounded. The proof of asymptotic normality of the distribution uses a method of factorial moments for variables with unbounded means that was recently derived by the authors. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2008 |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1002/rsa.v32:1 | Random Struct. Algorithms |
Keywords | Field | DocType |
moments,normal distribution | Discrete mathematics,Random regular graph,Combinatorics,Normal distribution,Random graph,Factorial,Infinity,Expected value,Mathematics,Asymptotic distribution,Bounded function | Journal |
Volume | Issue | ISSN |
32 | 1 | 1042-9832 |
Citations | PageRank | References |
6 | 0.63 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhicheng Gao | 1 | 300 | 35.97 |
| Nicholas C. Wormald | 2 | 1506 | 230.43 |