Bounds on the cover time
- 1 January 1989
- journal article
- Published by Springer Nature in Journal of Theoretical Probability
- Vol. 2 (1) , 101-120
- https://doi.org/10.1007/bf01048273
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Approximate counting, uniform generation and rapidly mixing Markov chainsInformation and Computation, 1989
- On the cover time of random walks on graphsJournal of Theoretical Probability, 1989
- Lower bounds for covering times for reversible Markov chains and random walks on graphsJournal of Theoretical Probability, 1989
- Bounds on the cover timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Eigenvalues and graph bisection: An average-case analysisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- On the second eigenvalue of random regular graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Eigenvalues and expandersCombinatorica, 1986
- Minimization Algorithms and Random Walk on the $d$-CubeThe Annals of Probability, 1983
- On the time taken by random walks on finite groups to visit every stateProbability Theory and Related Fields, 1983
- Random walks, universal traversal sequences, and the complexity of maze problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979