非回溯随机漫步的递归性和暂态性

IF 0.4 Q4 MATHEMATICS, APPLIED Journal of Combinatorics Pub Date : 2019-05-20 DOI:10.4310/joc.2020.v11.n3.a7

Paul Jung, Greg Markowsky

{"title":"非回溯随机漫步的递归性和暂态性","authors":"Paul Jung, Greg Markowsky","doi":"10.4310/joc.2020.v11.n3.a7","DOIUrl":null,"url":null,"abstract":"A short proof of the equivalence of the recurrence of non-backtracking random walk and that of simple random walk on regular infinite graphs is given. It is then shown how this proof can be extended in certain cases where the graph in question is not regular.","PeriodicalId":44683,"journal":{"name":"Journal of Combinatorics","volume":"13 1","pages":""},"PeriodicalIF":0.4000,"publicationDate":"2019-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Remarks on the recurrence and transience of non-backtracking random walks\",\"authors\":\"Paul Jung, Greg Markowsky\",\"doi\":\"10.4310/joc.2020.v11.n3.a7\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A short proof of the equivalence of the recurrence of non-backtracking random walk and that of simple random walk on regular infinite graphs is given. It is then shown how this proof can be extended in certain cases where the graph in question is not regular.\",\"PeriodicalId\":44683,\"journal\":{\"name\":\"Journal of Combinatorics\",\"volume\":\"13 1\",\"pages\":\"\"},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2019-05-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4310/joc.2020.v11.n3.a7\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4310/joc.2020.v11.n3.a7","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}

引用次数: 0

摘要

给出了正则无穷图上非回溯随机游走递归性与简单随机游走递归性等价的简短证明。然后说明了在所讨论的图不是正则图的某些情况下，这个证明是如何推广的。

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

查看原文

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

本刊更多论文

Remarks on the recurrence and transience of non-backtracking random walks

A short proof of the equivalence of the recurrence of non-backtracking random walk and that of simple random walk on regular infinite graphs is given. It is then shown how this proof can be extended in certain cases where the graph in question is not regular.

求助全文

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

来源期刊

Journal of Combinatorics MATHEMATICS, APPLIED-

自引率

0.00%

发文量

期刊最新文献

Counting abelian squares efficiently for a problem in quantum computing On Mallows’ variation of the Stern–Brocot tree The chromatic number of squares of random graphs Approximation of Frankl’s conjecture in the complement family The weighted spectrum of the universal cover and an Alon–Boppana result for the normalized Laplacian