Cutoff phenomena for random walks on random regular graphs
Author:
Affiliation:
1. Eyal Lubetzky, Microsoft Research
2. Allan Sly, Microsoft Research
Publisher
Duke University Press
Subject
General Mathematics
Reference28 articles.
1. M. Ajtai, Recursive construction for $3$-regular expanders, Combinatorica 14 (1994), 379--416.
2. D. Aldous, ``Random walks on finite groups and rapidly mixing Markov chains'' in Seminar on Probability, XVII, Lecture Notes in Math. 986, Springer, Berlin, 1983, 243--297.
3. D. Aldous and P. Diaconis, Shuffling cards and stopping times, Amer. Math. Monthly 93 (1986), 333--348.
4. D. Aldous and J. A. Fill, Reversible Markov Chains and Random Walks on Graphs, in preparation.
5. N. Alon, I. Benjamini, E. Lubetzky, and S. Sodin, Non-backtracking random walks mix faster, Commun. Contemp. Math. 9 (2007), 585--603.
Cited by 73 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Excessive symmetry can preclude cutoff;Linear Algebra and its Applications;2024-10
2. The varentropy criterion is sharp on expanders;Annales Henri Lebesgue;2024-06-27
3. Shared-Memory Parallel Edmonds Blossom Algorithm for Maximum Cardinality Matching in General Graphs;2024 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW);2024-05-27
4. Cutoff profile of the Metropolis biased card shuffling;The Annals of Probability;2024-03-01
5. Discordant edges for the voter model on regular random graphs;Latin American Journal of Probability and Mathematical Statistics;2024
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3