Expected cover times of random walks on symmetric graphs
- 1 July 1992
- journal article
- research article
- Published by Springer Nature in Journal of Theoretical Probability
- Vol. 5 (3), 597-600
- https://doi.org/10.1007/bf01060439
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- The electrical resistance of a graph captures its commute and cover timescomputational complexity, 1996
- On a Result of Aleliunas et al. Concerning Random Walks on GraphsProbability in the Engineering and Informational Sciences, 1990
- Random walks on highly symmetric graphsJournal of Theoretical Probability, 1990
- The electrical resistance of a graph captures its commute and cover timesPublished by Association for Computing Machinery (ACM) ,1989
- On the cover time of random walks on graphsJournal of Theoretical Probability, 1989
- An introduction to covering problems for random walks on graphsJournal of Theoretical Probability, 1989
- Covering Problems for Markov ChainsThe Annals of Probability, 1988
- Random walks, universal traversal sequences, and the complexity of maze problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979