Multiple random walks on graphs: mixing few to cover many

Abstract

AbstractRandom 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$k$multiple random walks independently and in parallel. Although the cover time of multiple walks has been investigated for many natural networks, the problem of finding a general characterisation of multiple cover times forworst-casestart vertices (posed by Alon, Avin, Koucký, Kozma, Lotker and Tuttle in 2008) remains an open problem. First, we improve and tighten various bounds on thestationarycover time when$k$random walks start from vertices sampled from the stationary distribution. For example, we prove an unconditional lower bound of$\Omega ((n/k) \log n)$on the stationary cover time, holding for any$n$-vertex graph$G$and any$1 \leq k =o(n\log n )$. Secondly, we establish thestationarycover times of multiple walks on several fundamental networks up to constant factors. Thirdly, we present a framework characterisingworst-casecover times in terms ofstationarycover times and a novel, relaxed notion of mixing time for multiple walks called thepartial mixing time. Roughly speaking, the partial mixing time only requires a specific portion of all random walks to be mixed. Using these new concepts, we can establish (or recover) theworst-casecover times for many networks including expanders, preferential attachment graphs, grids, binary trees and hypercubes.