The asymptotic distribution of long cycles in random regular graphs

Random Struct. Algorithms Pub Date : 1999-08-01 DOI:10.1002/(SICI)1098-2418(199908)15:1%3C43::AID-RSA3%3E3.0.CO;2-S

H. Garmo

引用次数: 19

Abstract

The asymptotic distribution of the number of cycles of length l in a random r-regular graph is determined. The length of the cycles is defined as a function of the number of vertices n, thus l = l(n), and the length satisfies l(n) --> infinity as n --> in

查看原文本刊更多论文

随机正则图中长周期的渐近分布

确定了随机r正则图中长度为l的环数的渐近分布。循环的长度定义为顶点数n的函数，因此l = l(n)，当n -> in时，长度满足l(n) ->∞

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Random Struct. Algorithms

自引率

0.00%

发文量