On the mean and variance of cover times for random walks on graphs
From MaRDI portal
Publication:1353782
DOI10.1006/jmaa.1997.5298zbMath0883.60067MaRDI QIDQ1353782
Frank G. Ball, Andre Hirschowitz, Bruce Dunham
Publication date: 4 March 1998
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jmaa.1997.5298
05C80: Random graphs (graph-theoretic aspects)
60G50: Sums of independent random variables; random walks
Cites Work
- Unnamed Item
- Unnamed Item
- Covering problems for Markov chains
- Lower bounds on the length of universal traversal sequences
- The electrical resistance of a graph captures its commute and cover times
- Bounds on the cover time
- Lower bounds for covering times for reversible Markov chains and random walks on graphs
- Finite Continuous Time Markov Chains
- Sojourn times in finite Markov processes
- Expected hitting and cover times of random walks on some special graphs