Covering a graph with independent walks
暂无分享,去创建一个
[1] M. Biskup. Extrema of the Two-Dimensional Discrete Gaussian Free Field , 2017 .
[2] H. Kaspi,et al. A Ray-Knight theorem for symmetric Markov processes , 2000 .
[3] Alex Zhai. Exponential concentration of cover times , 2014, 1407.7617.
[4] M. Biskup. Extrema of the Two-Dimensional Discrete Gaussian Free Field , 2017, Springer Proceedings in Mathematics & Statistics.
[5] Yuval Peres,et al. Cover times, blanket times, and majorizing measures , 2010, STOC '11.
[6] V. Climenhaga. Markov chains and mixing times , 2013 .
[7] I. Benjamini,et al. On an epidemic model on finite graphs , 2016, The Annals of Applied Probability.
[8] Thomas Sauerwald,et al. Tight bounds for the cover time of multiple random walks , 2009, Theor. Comput. Sci..
[9] Thomas Sauerwald,et al. Multiple Random Walks on Graphs: Mixing Few to Cover Many , 2021, ICALP.
[10] Noga Alon,et al. Many random walks are faster than one , 2007, SPAA '08.
[11] Omer Reingold,et al. How Well Do Random Walks Parallelize? , 2009, APPROX-RANDOM.
[12] David A. Levin,et al. Coupling from the past , 2008 .