9 citations · 42 across the 19 of their papers we have counts for
Showing 2020 · cs.DMShow all
2 papers · 2 filters
cs.DM2020★ 4 cited
Multiple Random Walks on Graphs: Mixing Few to Cover Many
Nicolás Rivera, Thomas Sauerwald, John Sylvester
Random walks on graphs are an essential primitive for many randomised algorithms and stochastic processes. It is natural to ask how much can be gained by running multiple rando…
cs.DM2020★ 3 cited
Time Dependent Biased Random Walks
John Haslegrave, Thomas Sauerwald, John Sylvester
We study the biased random walk where at each step of a random walk a "controller" can, with a certain small probability, move the walk to an arbitrary neighbour. This model was in…