Tight bounds for the cover time of multiple random walks

Theoretical Computer Science

Volumn 412, Issue 24, 2011, Pages 2623-2641

  Elsässer, Robert ^a   Sauerwald, Thomas ^b  

^a UNIVERSITY OF PADERBORN   (Germany)

^b SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Markov chains; Random walks; Stochastic processes

Indexed keywords

COVER TIME; HYPER-CUBES; LARGE CLASS; LOWER BOUNDS; MARKOV CHAIN; MIXING TIME; RANDOM GRAPHS; RANDOM WALK; RANDOM WALKS; SHARP THRESHOLD; SPEED-UPS; STOCHASTIC PROCESS; TIGHT BOUND; UNDIRECTED GRAPH; UPPER BOUND;

GRAPHIC METHODS; MARKOV PROCESSES; STOCHASTIC SYSTEMS;

SPEED;

EID: 79954807108     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2010.08.010     Document Type: Conference Paper

References (30)

1. M. Adler, E. Halperin, R. Karp, V. Vazirani, A stochastic process on the hypercube with applications to peer-to-peer networks, in: 35th Annual ACM Symposium on Theory of Computing, STOC'03, 2003, pp. 575584.
2. D. Aldous, J. Fill, Reversible Markov Chains and Random Walks on Graphs, 2002 (in preparation). Draft available at http://www.stat.berkeley.edu/~aldous/ RWG/book.html.
3. D.J. Aldous On the time taken by random walks on finite groups to visit every state Zeitschrift fr Wahrscheinlichkeitstheorie und verwandte Gebiete 62 3 1983 361 374
4. R. Aleliunas, R. Karp, R. Lipton, L. Lovsz, C. Rackoff, Random walks, universal traversal sequences, and the complexity of maze problems, in: 20th Annual IEEE Symposium on Foundations of Computer Science, FOCS'79, 1979, pp. 218223.
5. N. Alon, C. Avin, M. Koucky, G. Kozma, Z. Lotker, M. Tuttle, Many random walks are faster than one, in: 20th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'08, 2008, pp. 119128.
6. L. Babai, Local expansion of vertex-transitive graphs and random generation in finite groups, in: 23rd Annual ACM Symposium on Theory of Computing, STOC'91, 1991, pp. 164174.
7. P. Berenbrink, C. Cooper, R. Elsässer, T. Radzik, T. Sauerwald, Speeding up random walks with neighborhood exploration, in: 21th Annual ACMSIAM Symposium on Discrete Algorithms, SODA'10, 2010, pp. 14221435.
8. A. Broder, and A. Karlin Bounds on the cover time Journal of Theoretical Probability 2 1 1989 101 120
9. A. Broder, A. Karlin, P. Raghavan, and E. Upfal Trading space for time in undirected st connectivity SIAM Journal on Computing 23 2 1994 324 334
10. T. Carne A transmutation formula for Markov chains Bulletin des Sciences Mathematiques 109 1985 399 405
11. 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 1997 312 340 (Pubitemid 128060674)
12. C. Cooper, and A. Frieze The cover time of sparse random graphs Random Structures and Algorithms 30 2007 1 16
13. C. Cooper, A. Frieze, T. Radzik, Multiple random walks and interacting particle systems, in: 36th International Colloquium on Automata, Languages, and Programming, ICALP'09, 2009, pp. 399410.
14. A. Czumaj, C. Sohler, Testing expansion in bounded-degree graphs, in: 48th Annual IEEE Symposium on Foundations of Computer Science, FOCS'07, 2007, pp. 570578.
15. P. Diaconis Comparison theorems for reversible markov chains The Annals of Applied Probability 2 1993 696 730
16. P. Diaconis, R. Graham, and J. Morrison Asymptotic analysis of a random walk on a hypercube with many dimensions Random Structures and Algorithms 1 1 1990 51 72
17. N.B. Dimitrov, C.G. Plaxton, Optimal cover time for a graph-based coupon collector process, in: 32nd International Colloquium on Automata, Languages, and Programming, ICALP'05, 2005, pp. 702716. (Pubitemid 41436140)
18. K. Efremenko, O. Reingold, How well do random walks parallelize? in: 13th International Workshop on Randomization and Computation, RANDOM'09, 2009, pp. 476489.
19. R. Elsässer, T. Sauerwald, Tight bounds for the cover time of multiple random walks, in: 36th International Colloquium on Automata, Languages, and Programming, ICALP'09, 2009, pp. 415426.
20. P. Erds, and A. Rnyi On random graphs Publicationes Mathematicae Debrecen 6 1959 290 297
21. U. Feige A tight lower bound for the cover time of random walks on graphs Random Structures and Algorithms 6 4 1995 433 438
22. U. Feige A tight upper bound for the cover time of random walks on graphs Random Structures and Algorithms 6 1 1995 51 54
23. S. Ikeda, I. Kubo, N. Okumoto, M. Yamashita, Impact of local topological information on random walks on finite graphs, in: 30st International Colloquium on Automata, Languages, and Programming, ICALP'03, 2003, pp. 10541067.
24. S. Kale, C. Seshadhri, Property testing on k-vertex-connectivity of graphs, in: 35th International Colloquium on Automata, Languages, and Programming, ICALP'08, 2008, pp. 527538.
25. L. Lovsz Random walks on graphs: a survey Combinatorics 2 1993 1 46 (Paul Erds is Eighty)
26. P. Matthews Covering problems for Brownian motion on spheres Annals of Probability 16 1 1988 189 199
27. C. McDiarmid On the method of bounded differences London Mathematical Society Lecture Note Series vol. 141 1989 148 188
28. A. Sinclair Improved bounds for mixing rates of Markov chains and multicommodity flow Combinatorics, Probability & Computing 1 1992 351 370
29. A. Sinclair Algorithms for Random Generation and Counting 1993 Birkhuser
30. D. Zuckerman A technique for lower bounding the cover time SIAM Journal on Discrete Mathematics 5 1 1992 81 87