Covering times of random walks on bounded degree trees and other graphs

DOI10.1007/BF01048276zbMath0691.60063MaRDI QIDQ582702

David Zuckerman

Publication date: 1989

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

zbMATH Keywords

treesrandom walkcovering times

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Sums of independent random variables; random walks (60G50) Stopping times; optimal stopping problems; gambling theory (60G40)

Related Items (6)

Covering with blocks in the non-symmetric case ⋮ Threshold limits for cover times ⋮ A bound for the covering time of random walks on graphs ⋮ Many Random Walks Are Faster Than One ⋮ New Bounds for Edge-Cover by Random Walk ⋮ Random walk covering of some special trees

Cites Work

• Unnamed Item
• Markov chain models - rarity and exponentiality
• On the cover time of random walks on graphs
• Finite Continuous Time Markov Chains
• Random walks on random trees

This page was built for publication: Covering times of random walks on bounded degree trees and other graphs