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

DOI10.1007/BF01048276MaRDI QIDQ582702zbMATH OpenFDO

Authors David Zuckerman

Publication date 1989

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

zbMATH Keywords

random walktreescovering 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)

Cites work

• scientific article; zbMATH DE number 3936137 (Why is no real title available?)
• Finite Continuous Time Markov Chains
• Markov chain models - rarity and exponentiality
• On the cover time of random walks on graphs
• Random walks on random trees

Cited in

(8)

• Threshold limits for cover times
• Covering with blocks in the non-symmetric case
• Random walk covering of some special trees
• A bound for the covering time of random walks on graphs
• Cover time for branching random walks on regular trees
• A Spanning Tree Method for Bounding Hitting Times of Random Walks on Graphs
• New bounds for edge-cover by random walk
• Many Random Walks Are Faster Than One

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q582702)