On the mean and variance of cover times for random walks on graphs

DOI10.1006/jmaa.1997.5298zbMath0883.60067OpenAlexW2005658907MaRDI QIDQ1353782

Bruce Dunham, Frank G. Ball, Andre Hirschowitz

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

zbMATH Keywords

generating functionMarkov chainrandom walk

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Sums of independent random variables; random walks (60G50)

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

This page was built for publication: On the mean and variance of cover times for random walks on graphs