Expected cover times of random walks on symmetric graphs

DOI10.1007/BF01060439zbMath0754.60077OpenAlexW2001528257MaRDI QIDQ1194485

José Luis Palacios

Publication date: 27 September 1992

Published in: Journal of Theoretical Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01060439

zbMATH Keywords

symmetric graphrandom walkcover time

Mathematics Subject Classification ID

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

Related Items (2)

Covering with blocks in the non-symmetric case ⋮ Random walks on edge transitive graphs

Cites Work

• Unnamed Item
• Covering problems for Markov chains
• Random walks on highly symmetric graphs
• The electrical resistance of a graph captures its commute and cover times
• On the cover time of random walks on graphs
• An introduction to covering problems for random walks on graphs
• On a Result of Aleliunas et al. Concerning Random Walks on Graphs

This page was built for publication: Expected cover times of random walks on symmetric graphs