2008 · 155 citations · 31 references
ComputingComputer ScienceAlgorithmsCombinatoricsParallel ComputingDistributed ComputingGraph AlgorithmsGraph TheoryRandom WalksExpected-time AnalysisRandom Walk AlgorithmsRandom Walk Cover TimeRandom Walks On GraphsRandomized Graph Algorithms
We pose a new and intriguing question motivated by distributed computing regarding random walks on graphs: How long does it take for several independent random walks, starting from the same vertex, to cover an entire graph? We study the cover time - the expected time required to visit every node in a graph at least once - and we show that for a large collection of interesting graphs, running many random walks in parallel yields a speed-up in the cover time that is linear in the number of parallel walks. We demonstrate that an exponential speed-up is sometimes possible, but that some natural graphs allow only a logarithmic speed-up. A problem related to ours (in which the walks start from some probablistic distribution on vertices) was previously studied in the context of space efficient algorithms for undirected s-t-connectivity and our results yield, in certain cases, an improvement upon some of the earlier bounds.
31
Random Walks on Graphs: A Survey
László Lovász · 2001 · 1.4K citations
COMBINATORICA · 1986 · 1.2K citations
Rumor routing algorthim for sensor networks
David Braginsky, Deborah Estrin · 2002 · 776 citations
Random walks, universal traversal sequences, and the complexity of maze problems
Romas Aleliunas, Richard M. Karp, Richard J. Lipton et al. · 1979 · 705 citations
Random walks in peer-to-peer networks
Christos Gkantsidis, Milena Mihail, Amin Saberi · 2004 · 531 citations