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

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

{"title":"随机正则图中长周期的渐近分布","authors":"H. Garmo","doi":"10.1002/(SICI)1098-2418(199908)15:1%3C43::AID-RSA3%3E3.0.CO;2-S","DOIUrl":null,"url":null,"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","PeriodicalId":303496,"journal":{"name":"Random Struct. Algorithms","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"The asymptotic distribution of long cycles in random regular graphs\",\"authors\":\"H. Garmo\",\"doi\":\"10.1002/(SICI)1098-2418(199908)15:1%3C43::AID-RSA3%3E3.0.CO;2-S\",\"DOIUrl\":null,\"url\":null,\"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\",\"PeriodicalId\":303496,\"journal\":{\"name\":\"Random Struct. Algorithms\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Random Struct. Algorithms\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/(SICI)1098-2418(199908)15:1%3C43::AID-RSA3%3E3.0.CO;2-S\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Random Struct. Algorithms","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/(SICI)1098-2418(199908)15:1%3C43::AID-RSA3%3E3.0.CO;2-S","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 19

摘要

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

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

The asymptotic distribution of long cycles in random regular graphs

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

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Random Struct. Algorithms

自引率

0.00%

发文量

期刊最新文献

Monochromatic paths in random tournaments On Generalized Independent Subsets of Trees Inequalities in Probability Theory and Turán-Type Problems for Graphs with Colored Vertices On the effect of selection in genetic algorithms The Boyer-Moore-Horspool heuristic with Markovian input