A tight upper bound on the cover time for random walks on graphs-Reference-Cited by-同舟云学术

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

A tight upper bound on the cover time for random walks on graphs

Published:1995-01 Issue:1 Volume:6 Page:51-54
ISSN:1042-9832
Container-title:Random Structures & Algorithms
language:en
Short-container-title:Random Struct. Alg.

Author:

Feige Uriel

Publisher

Wiley

Subject

Applied Mathematics,Computer Graphics and Computer-Aided Design,General Mathematics,Software

Reference8 articles.

1. D. J. Aldous Reversible Markov chains and random walks on graphs 1993

2. R. Aleliunas R. M. Karp R. J. Lipton L. Lovász C. Rackoff Random walks, universal traversal sequences, and the complexity of maze problems 1979 218 223

3. Maximum hitting times for random walks on graphs;Brightwell;Random Struct. Alg.,1990

4. A. Chandra P. Raghavan W. Ruzzo R. Smolensky P. Tiwari The electrical resistance of a graph captures its commute and cover times 1989 574 586

5. Collisions among random walks on a graph;Coppersmith;SIAM J. Discrete Math.

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

1. On cover times of Markov chains;Stochastic Models;2024-03-12

2. Reversible random walks on dynamic graphs;Random Structures & Algorithms;2023-06-21

3. Meeting Times of Non-atomic Random Walks;Lecture Notes in Computer Science;2023

4. Unexpected advantages of exploitation for target searches in complex networks;Chaos: An Interdisciplinary Journal of Nonlinear Science;2022-08

5. On the Cover Time of the Emerging Giant;SIAM Journal on Discrete Mathematics;2022-07-21

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP