Thomas Sauerwald
ABSTRACT
We study the cover time of parallel random walks which was recently introduced by Alon et al. [2]. We consider k parallel (independent) random walks starting from arbitrary vertices. The expected number of steps until these k walks have visited all n vertices is called cover time of G.
In this paper we present a lower bound on the cover time of Ω( √n/k • √(1/Φ(G))}, where Φ(G) is the geometric expansion (a.k.a. as edge expansion or conductance). This bound is matched for any 1 ≤ k ≤ n by binary trees up to logarithmic factors. Our lower bound combined with previous results also implies a new characterization of expanders. Roughly speaking, the edge expansion Φ(G) satisfies 1/Φ(G) = O(polylog(n)) if and only if G has a cover time of O(n/k • polylog (n)) for all 1 ≤ k ≤ n. We also present new upper bounds on the cover time with sublinear dependence on the (algebraic) expansion.
- D. Aldous and J. Fill. Reversible Markov Chains and Random Walks on Graphs (in preparation, draft availabe at http://www.stat.berkeley.edu/aldous/RWG/book.html, 2002.Google Scholar
- N. Alon, C. Avin, M. Koucky, G. Kozma, Z. Lotker, and M. Tuttle. Many Random Walks are faster than one. In SPAA'08, pages 119--128, 2008. Google ScholarDigital Library
- A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, and C. Scheideler. The effect of faults on network expansion. Theory of Computing Systems, 39(6):903--928, 2006. Google ScholarDigital Library
- A. Broder and A. Karlin. Bounds on the cover time. Journal of Theoretical Probability, 2(1):101--120, 1989.Google ScholarCross Ref
- A. Broder, A. Karlin, P. Raghavan, and E. Upfal. Trading space for time in undirected s-t connectivity. SIAM Journal on Computing, 23(2):324--334, 1994. Google ScholarDigital Library
- T. Carne. A Transmutation Formula for Markov Chains. Bulletin des Sciences Mathematiques, 109:399--405, 1985.Google Scholar
- A. Chandra, P. Raghavan, W. Ruzzo, R. Smolensky, and P. Tiwari. The Electrical Resistance of a Graph Captures its Commute and Cover Times. Computational Complexity, 6(4):312--340, 1997.Google ScholarCross Ref
- A. Czumaj and C. Sohler. Testing expansion in bounded-degree graphs. In FOCS'07, pages 570--578, 2007. Google ScholarDigital Library
- A. Das Sarma, D. Nanongkai, and G. Pandurangan. Fast distributed random walks. In PODC'09, pages 161--170, 2009. Google ScholarDigital Library
- A. Das Sarma, D. Nanongkai, G. Pandurangan, and P. Tetali. Efficient distributed random walks with applications. In PODC'10, to appear. Google ScholarDigital Library
- K. Efremenko and O. Reingold. How well do random walks parallelize. In RANDOM'09, pages 476--489, 2009. Google ScholarDigital Library
- R. Elsässer and T. Sauerwald. Tight Bounds on the Cover Time of Multiple Random Walks. In ICALP'09, pages 415--426, 2009. Google ScholarDigital Library
- U. Feige. A Tight Upper Bound for the Cover Time of Random Walks on Graphs. Random Structures and Algorithms, 6(1):51--54, 1995.Google ScholarCross Ref
- U. Feige. A Tight Lower Bound for the Cover Time of Random Walks on Graphs. Random Structures and Algorithms, 6(4):433--438, 1995.Google ScholarCross Ref
- U. Feige. Collecting Coupons on Trees, and the Cover Time of Random Walks. Computational Complexity, 6(4):341--356, 1997.Google ScholarCross Ref
- U. Feige. A Spectrum of Time-Space Tradeoffs for Undirected s-t Connectivity. Journal of Computer and System Sciences, 54(2):305--316, 1997. Google ScholarDigital Library
- D. Gillman. A Chernoff Bound for Random Walks on Expander Graphs. SIAM Journal on Computing, 27(4):1203--1220, 1998. Google ScholarDigital Library
- N. Goyal, L. Rademacher, and S. Vempala. Expanders via random spanning trees. In SODA'09, pages 576--585, 2009. Google ScholarDigital Library
- V. Guruswami. Rapidly Mixing Markov Chains, 2000. unpublished, available at http://www.cs.cmu.edu/~venkatg/pubs/papers/markov-survey.ps.Google Scholar
- S. Hoory, N. Linial, and A. Wigderson. Expander graphs and their applications. Bulletin of the American Mathematical Society, 43(4): 439--561, 2006.Google ScholarCross Ref
- J. Kahn, J. Kim, L. Lovász, and V. Vu. The cover time, the blanket time and the Matthews bound. In FOCS'00, pages 467--475, 2000. Google ScholarDigital Library
- L. Lovász. Random walks on graphs: A survey. Combinatorics, Paul Erdös is Eighty 2:1--46, 1993.Google Scholar
- R. Motwani and P. Raghavan. Randomized Algorithms, Cambridge University Press, 1995. Google ScholarDigital Library
- A. Sinclair. Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow. Combinatorics, Probability & Computing, 1:351--370, 1992.Google ScholarCross Ref
- P. Tetali and P. Winkler. On a random walk problem arising in self-stabilizing token management. In PODC'91, pages 273--280, 1991. Google ScholarDigital Library
- D. Zuckerman. A Technique for Lower Bounding the Cover Time. SIAM Journal on Discrete Mathematics, 5(1):81--87, 1992. Google ScholarDigital Library
Index Terms
- Expansion and the cover time of parallel random walks
Recommendations
Tight bounds for the cover time of multiple random walks
We study the cover time of multiple random walks on undirected graphs G=(V,E). We consider k parallel, independent random walks that start from the same vertex. The speed-up is defined as the ratio of the cover time of a single random walk to the cover ...
Expander properties and the cover time of random intersection graphs
We investigate important combinatorial and algorithmic properties of G"n","m","p random intersection graphs. In particular, we prove that with high probability (a) random intersection graphs are expanders, (b) random walks on such graphs are ''rapidly ...
Better Bounds for Coalescing-Branching Random Walks
SPAA '16: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and ArchitecturesCoalescing-branching random walks, or cobra walks for short, are a natural variant of random walks on graphs that can model the spread of disease through contacts or the spread of information in networks. In a k-cobra walk, at each time step a subset of ...
Comments