Random walks which prefer unvisited edges: Exploring high girth even degree expanders in linear time
Author:
Affiliation:
1. School of Computing Science; Simon Fraser University; Burnaby Canada
2. Department of Informatics; King's College; London UK
3. School of Engineering and Computing Sciences; Durham University; Durham UK
Funder
Engineering and Physical Sciences Research Council
Publisher
Wiley
Subject
Applied Mathematics,Computer Graphics and Computer-Aided Design,General Mathematics,Software
Link
http://onlinelibrary.wiley.com/wol1/doi/10.1002/rsa.20504/fullpdf
Reference16 articles.
1. Lower bounds for covering times for reversible markov chains and random walks on graphs;Aldous;J Theor Probab,1989
2. D. Aldous J. Fill Reversible Markov chains and random walks on graphs 2001 http://stat-www.berkeley.edu/users/aldous/RWG/book.html
3. C. Avin B. Krishnamachari The power of choice in random walks: An empirical study Proceedings of the 9th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, MSWiM 2006 Terromolinos, Spain 2006 219 228
4. P. Berenbrink C. Cooper T. Friedetzky Speeding up random walks by choosing unvisited edges or vertices 2012 http://www.dcs.kcl.ac.uk/staff/ccooper/papers/R-regular-unvisited-first.pdf
5. Derandomizing random walks in undirected graphs using locally fair exploration strategies;Cooper;Distrib Comput,2011
Cited by 6 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Random spanning trees for expanders, sparsifiers, and virtual network security;Computer Communications;2023-12
2. The power of two choices for random walks;Combinatorics, Probability and Computing;2021-05-28
3. The Cover Time of a Biased Random Walk on a Random Regular Graph of Odd Degree;The Electronic Journal of Combinatorics;2020-10-16
4. Exploring Low-degree nodes first accelerates Network Exploration;12th ACM Conference on Web Science;2020-06-23
5. The Robot Crawler Model on Complete k-Partite and Erdős-Rényi Random Graphs;Lecture Notes in Computer Science;2019
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3