Abstract
The asymptotic distribution of the number of Hamilton cycles in a random regular graph is determined. The limit distribution is of an unusual type; it is the distribution of a variable whose logarithm can be written as an infinite linear combination of independent Poisson variables, and thus the logarithm has an infinitely divisible distribution with a certain discrete Lévy measure. Similar results are found for some related problems. These limit results imply that some different models of random regular graphs are contiguous, which means that they are qualitatively asymptotically equivalent. For example, if r > 3, then the usual (uniformly distributed) random r-regular graph is contiguous to the one constructed by taking the union of r perfect matchings on the same vertex set (assumed to be of even cardinality), conditioned on there being no multiple edges. Some consequences of contiguity for asymptotic distributions are discussed.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference24 articles.
1. The asymptotic distribution of short cycles in random regular graphs
2. [17] Molloy M. , Robalewska-Szarłat H. , Robinson R.W. and Wormald N.C. (to appear) 1-factorisations of random regular graphs.
3. [18] Robalewska-Szarłat H. (to appear) 2-factors in random regular graphs.
4. The number of matchings in random regular graphs and bipartite graphs
5. Asymptotic Methods in Statistical Decision Theory
Cited by
69 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献