Cover times for sequences of reversible Markov chains on random graphs-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Cover times for sequences of reversible Markov chains on random graphs

Published:2014-01-01 Issue:3 Volume:54 Page:
ISSN:2156-2261
Container-title:Kyoto Journal of Mathematics
language:
Short-container-title:Kyoto J. Math.

Author:

Abe Yoshihiro

Publisher

Duke University Press

Reference25 articles.

1. [2] D. J. Aldous, Random walk covering of some special trees, J. Math. Anal. Appl. 157 (1991), 271–283.

2. [3] K. B. Athreya and P. E. Ney, Branching Processes, reprint of the 1972 original, Dover, Mineola, N.Y., 2004.

3. [4] M. T. Barlow, “Diffusions on Fractals” in Lectures in Probability Theory and Statistics (Saint-Flour, France, 1995), Lecture Notes in Math. 1690, Springer, Berlin, 1998.

4. [5] M. T. Barlow, J. Ding, A. Nachmias, and Y. Peres, The evolution of the cover time, Combin. Probab. Comput. 20 (2011), 331–345.

5. [6] I. Benjamini and G. Kozma, A resistance bound via an isoperimetric inequality, Combinatorica 25 (2005), 645–650.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Brownian motion on stable looptrees;Annales de l'Institut Henri Poincaré, Probabilités et Statistiques;2021-05-01

2. Maxima of branching random walks with piecewise constant variance;Brazilian Journal of Probability and Statistics;2018-11-01

3. Geometry of the Gibbs measure for the discrete 2D Gaussian free field with scale-dependent variance;Latin American Journal of Probability and Mathematical Statistics;2017

4. Random walks on graphs with interval weights and precise marginals;International Journal of Approximate Reasoning;2016-06

5. Effective resistances for supercritical percolation clusters in boxes;Annales de l'Institut Henri Poincaré, Probabilités et Statistiques;2015-08-01

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3