A tight upper bound on the cover time for random walks on graphs
- 1 January 1995
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 6 (1), 51-54
- https://doi.org/10.1002/rsa.3240060106
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Random walks and the effective resistance of networksJournal of Theoretical Probability, 1991
- Maximum hitting time for random walks on graphsRandom Structures & Algorithms, 1990
- The electrical resistance of a graph captures its commute and cover timesPublished by Association for Computing Machinery (ACM) ,1989
- Random Walks and Electric NetworksPublished by American Mathematical Society (AMS) ,1984
- Random walks, universal traversal sequences, and the complexity of maze problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979