Author:
Benjamini Itai,Gurel-Gurevich Ori,Morris Ben
Publisher
Springer Science and Business Media LLC
Subject
Statistics, Probability and Uncertainty,Statistics and Probability,Analysis
Reference5 articles.
1. Aldous D.J.: Threshold limits for cover times. J. Theor. Probab. 4, 197–211 (1991). doi: 10.1007/BF01047002
2. Aldous, D., Fill, J.: Reversible Markov chains and random walks on graphs (1999). http://www.stat.berkeley.edu/aldous/RWG/book.html
3. Feige U.: A tight lower bound on the cover time for random walks on graphs. Random Struct. Algorithms 6(4), 433–438 (1995). doi: 10.1002/rsa.3240060406
4. Levin, D.A., Peres, Y., Wilmer, E.L.: Markov chains and mixing times. American Mathematical Society, Providence (2006)
5. Janson S., Łuczak T., Ruciński A.: Random graphs. In: Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, New York (2000)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Greedy Random Walk;Combinatorics, Probability and Computing;2013-11-20
2. On large deviations for the cover time of two-dimensional torus;Electronic Journal of Probability;2013-01-01