Multiple cover time

DOI10.1002/(SICI)1098-2418(199612)9:4%3C403::AID-RSA4%3E3.0.CO;2-0MaRDI QIDQ3123120zbMATH OpenOpenAlexFDO

Authors Peter Winkler, David Zuckerman

Publication date 1 October 1997

Full work available at URL https://doi.org/10.1002/(sici)1098-2418(199612)9:4%3C403::aid-rsa4%3E3.0.co;2-0

zbMATH Keywords

graphrandom walkcyclecover timepathcoupon collectingblanket time

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Paths and cycles (05C38)

Recommendations

• Cover times, blanket times, and majorizing measures
• Cover times, blanket times, and majorizing measures
• On the cover time of random walks on graphs
• Lower bounds for covering times for reversible Markov chains and random walks on graphs
• How Well Do Random Walks Parallelize?

Cited in

(14)

• The evolution of the cover time
• A polynomial time approximation scheme for computing the supremum of Gaussian processes
• Derandomizing random walks in undirected graphs using locally fair exploration strategies
• Cover times, blanket times, and majorizing measures
• Convergence of blanket times for sequences of random walks on critical random graphs
• On the cover time and mixing time of random geometric graphs
• Memory Efficient Anonymous Graph Exploration
• Learning and testing irreducible Markov chains via the k-cover time
• scientific article; zbMATH DE number 716161 (Why is no real title available?)
• The Cover Time of Cartesian Product Graphs
• Cover times, blanket times, and majorizing measures
• Quantitative covering and equidistribution
• Random walks on colored graphs
• New bounds for edge-cover by random walk

This page was built for publication: Multiple cover time

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