Multiple cover time

DOI<403::AID-RSA4>3.0.CO;2-0 10.1002/(SICI)1098-2418(199612)9:4<403::AID-RSA4>3.0.CO;2-0zbMath0872.60054OpenAlexW2054976296MaRDI QIDQ3123120

Peter M. Winkler, David Zuckerman

Publication date: 1 October 1997

Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199612)9:4<403::aid-rsa4>3.0.co;2-0

zbMATH Keywords

graphcyclepathrandom walkcover timecoupon collectingblanket time

Mathematics Subject Classification ID

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

Related Items

On the cover time and mixing time of random geometric graphs ⋮ Memory Efficient Anonymous Graph Exploration ⋮ Convergence of blanket times for sequences of random walks on critical random graphs ⋮ Cover times, blanket times, and majorizing measures ⋮ Derandomizing random walks in undirected graphs using locally fair exploration strategies ⋮ The Evolution of the Cover Time ⋮ The Cover Time of Cartesian Product Graphs ⋮ New Bounds for Edge-Cover by Random Walk ⋮ A polynomial time approximation scheme for computing the supremum of Gaussian processes