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

DOI10.1007/BF01048276zbMATH Open0691.60063MaRDI QIDQ582702FDOQ582702

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

• Markov chain models - rarity and exponentiality
• Finite Continuous Time Markov Chains
• Title not available (Why is that?)
• Random walks on random trees
• On the cover time of random walks on graphs

Cited In (8)

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

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)