Skip to Main content Skip to Navigation
Conference papers

Multiple Random Walks on Paths and Grids

Abstract : We derive several new results on multiple random walks on "low dimensional" graphs. First, inspired by an example of a weighted random walk on a path of three vertices given by Efremenko and Reingold, we prove the following dichotomy: as the path length n tends to infinity, we have a super-linear speed-up w.r.t. the cover time if and only if the number of walks k is equal to 2. An important ingredient of our proofs is the use of a continuous-time analogue of multiple random walks, which might be of independent interest. Finally, we also present the first tight bounds on the speed-up of the cover time for any d-dimensional grid with d >= 2 being an arbitrary constant, and reveal a sharp transition between linear and logarithmic speed-up.
Document type :
Conference papers
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : Adrian Kosowski Connect in order to contact the contributor
Submitted on : Wednesday, February 7, 2018 - 4:44:23 PM
Last modification on : Tuesday, January 11, 2022 - 11:16:04 AM
Long-term archiving on: : Friday, May 25, 2018 - 9:21:23 PM


Files produced by the author(s)



Andrej Ivaskovic, Adrian Kosowski, Dominik Pająk, Thomas Sauerwald. Multiple Random Walks on Paths and Grids . STACS 2017 - 34th Symposium on Theoretical Aspects of Computer Science, Mar 2017, Hannover, Germany. pp.1-14, ⟨10.4230/LIPIcs.STACS.2017.44⟩. ⟨hal-01669223⟩



Les métriques sont temporairement indisponibles