Distribution of the number of spanning regular subgraphs in random graphs |
| |
| Authors: | Pu Gao |
| |
| Affiliation: | Algorithms and Complexity, Max‐Planck‐Institute für Informatik, Saarbrücken, Germany |
| |
| Abstract: | In this paper, we examine the moments of the number of d ‐factors in begin{align*}mathcal{ G}(n,p)end{align*} for all p and d satisfying d3 = o(p2n). We also determine the limiting distribution of the number of d ‐factors inside this range with further restriction that begin{align*}(1-p)sqrt{dn}toinftyend{align*} as n →∞.© 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2013 |
| |
| Keywords: | d‐factors log‐normal distribution method of moments switching method |
|
|
