Tight Bounds for the Cover Time of Multiple Random Walks

DOI10.1007/978-3-642-02927-1_35MaRDI QIDQ3638052zbMATH OpenOpenAlexFDO

Authors Robert Elsässer, Thomas Sauerwald

Publication date 14 July 2009

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02927-1_35

zbMATH Keywords

cover timeindependent random walksmaximum hitting timemixing timemultiple random walkstorus graphs

Mathematics Subject Classification ID

Random walks on graphs (05C81) Sums of independent random variables; random walks (60G50) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Tight bounds for the cover time of multiple random walks
• How Well Do Random Walks Parallelize?
• Many Random Walks Are Faster Than One
• Multiple random walks on paths and grids
• Expansion and the cover time of parallel random walks

Cited in

(7)

• Replica overlap and covering time for the Wiener sausages among Poissonian obstacles
• The cover time of a (multiple) Markov chain with rational transition probabilities is rational
• Multiple random walks on paths and grids
• scientific article; zbMATH DE number 878361 (Why is no real title available?)
• Expansion and the cover time of parallel random walks
• Tight bounds for the cover time of multiple random walks
• Multiple random walks on graphs: mixing few to cover many

This page was built for publication: Tight Bounds for the Cover Time of Multiple Random Walks

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