Tight Bounds for the Cover Time of Multiple Random Walks

DOI10.1007/978-3-642-02927-1_35zbMath1247.05224OpenAlexW1564693713MaRDI QIDQ3638052

Thomas Sauerwald, Robert Elsässer

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

mixing timecover timeindependent random walksmultiple random walkstorus graphsmaximum hitting time

Mathematics Subject Classification ID

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

Related Items (1)

Tight bounds for the cover time of multiple random walks

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