Many random walks are faster than one

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2008, Pages 119-128

  Alon, Noga ^a   Kozma, Gady ^b   Avin, Chen ^c   Lotker, Zvi ^c   Koucky, Michal ^d   Tuttle, Mark R ^e  

^a TEL AVIV UNIVERSITY   (Israel)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^d INSTITUTE OF MATHEMATICS   (Czech Republic)

^e INTEL CORPORATION   (United States)

Author keywords

Cover time; Distributed algorithms; Graph search; Random walks; Speed up

Indexed keywords

NUMERICAL ANALYSIS; PARALLEL ALGORITHMS; PROBABILITY DISTRIBUTIONS; SPEED;

COVER TIME; DISTRIBUTED ALGORITHMS; GRAPH SEARCH; RANDOM WALKS; SPEED-UP;

RANDOM PROCESSES;

EID: 57349120535     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1378533.1378557     Document Type: Conference Paper

References (34)

1. ALANYALI, M., SALIGRAMA, V., AND SAVA. O. A random-walk model for distributed compilation in energy-limited network. In In Proc. of 1st Workshop on Information Theory and its Application (San Diego, 2006).
2. ALDOUS, D. J. On the time taken by random on finite groups to visit every state. Z. Wahrsch. Verm. Gebiete 62, 3 (1983), 361-374.
3. ALDOUS, D, J. Lower bounds for covering times for reversible markov chains and random walks on graphs. J. Theoret. Probab. 2, 1 (1989), 91-100.
4. ALDOUS, D. J. Threshold limits for cover times. Journal of Theoretical Probability V4, 1 (1991), 197-211.
5. ALELIUNAS, R., KARP, R. M., LIPTON. R. J., LOVÁSZ, L., AND RACKOFF, C. Random walks, universal traversal sequences, and the complexity of maze problems. In 20th Annual Symposium on Foundations of Computer Science (San Juan, Puerto Rico, 1979). IEEE, New York, 1979, pp. 218-223.
6. ALON, N. Eigenvalues and expanders. Combinatorica 6, 2 (1986), 83-96.
7. 4/3 space algorithm for (s,t) connectivity in undirected graphs. Journal, of the ACM 47, 2 (2000), 294-311.
8. AVIN, C., AND BRITO, C. Efficient and robust query processing in dynamic environments using random walk techniques. In Proc. of the third international symposium on Information processing in sensor networks (2004), pp. 277-286.
9. AVIN, C., AND ERCAL, G. On the cover time of random geometric graphs. In Proc. Automata, Languages and Programming, 32nd International Colloquium, ICALP05 (2005), pp. 677-689.
10. BAR-YOSSEF, Z., FRIEDMAN, R., AND KLIOT, G. Rawms -: random walk based lightweight membership service for wireless ad hoc network. In MobiHoc '06: Proceedings of the seventh ACM international symposium on Mobile ad hoc networking and computing (New York, NY, USA, 2006), ACM Press, pp. 238-249.
11. BARNES, G., AND FEIGE, U. A spectrum of time-space tradeoffs for undirected s-t connectivity. Journal of Computer and System Sciences 2, 54 (1997), 305-316.
12. BRAGINSKY, D., AND ESTRIN, D. Rumor routing algorthim for sensor networks. In Proc. of the 1st ACM Int. workshop on Wireless sensor networks and applications (2002), ACM Press, pp. 22-31.
13. BRODER, A., AND KARLIN, A. Bounds on the cover time. J. Theoret. Probab. 2 (1989), 101-120.
14. BRODER, A., KARLIN, A., RAGHAVAN, P., AND UPFAL, E. Trading space for time in undirected s-t connectivity. In Proc. ACM Symp. Theory of Computing (1989), pp. 543-549.
15. CHANDRA, A. K., RAGHAVAN, P., UZZO, W. L., AND SMOLENSKY, R. The electrical resistance of a graph captures its commute and cover times. In Proc. of the twenty-first annual ACM symposium, on Theory of computing (1989), ACM Press, pp. 574-586.
16. COOPER, C., AND FRIEZE, A. The cover time of sparse random graphs. In Proceedings of the fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-OS) (Baltimore, Maryland, USA, 2003), ACM Press, pp. 140-147.
17. DOLEV, S., SCHILLER, E., AND WELCH, J. Random walk for self-stabilizing group communication in ad-hoc networks. In Proceedings of the 21st IEEE Symposium on Reliable Distributed, Systems (SRDS'02) (2002), IEEE Computer Society, p. 70.
18. FEIGE, U. A tight lower bound on the cover time for random walks on graphs. Random, Structures and Algorithms 6, 4 (1995), 433-438.
19. FEIGE, U. A tight upper bound on the cover time for random walks on graphs. Random Structures and Algorithms 6, 1 (1995), 51-54.
20. FEIGE, U. Short random walks on graphs. SIAM Journal on Discrete Mathematics 1, 9 (1996), 19-28.
21. GKANTSIDIS, C., MLHAIL, M., AND SABERI, A. Random walks in peer-to-peer networks. In in Proc. 23 Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM). to appear (2004).
22. HALPERIN, S., AND ZWICK, U. An optimal randomized logarithmic time connectivity algorithm for the EREW PRAM. Journal of Computer and System, Sciences 53 (1996), 395-416.
23. JERRUM. M., AND SINCLAIR, A. The markov chain monte carlo method: An approach to approximate counting and integration. In Approximations for NP-hard Problems. Dorit Hochbaum ed. PWS Publishing, Boston, MA, 1997, pp. 482-520.
24. JONASSON, J. On the cover time for random walks on random graphs. Comb. Probab. Comput. 7, 3 (1998), 265-279.
25. JONASSON, J., AND SCHRAMM, O. On the cover time of planar graphs. Electronic Communications in Probability 5 (2000), 85-90.
26. KARGER, D. R., NISAN, N., AND PARNAS, M. Fast connected components algorithms for the EREW PRAM. SIAM J. Comput. 28, 3 (1999), 1021-1034.
27. LOVÁSZ, L. Random walks on graphs: A survey. In Combinatorics, Paul Erdos is eighty. Vol. 2 (Keszthely, 1993), vol. 2 of Bolyai Soc. Math. Stud. János Bolyai Math. Soc., Budapest, 1996, pp. 353-397.
28. MATTHEWS, P. Covering problems for brownian motion on spheres. Ann. Probab. 16, 1 (1988), 189-199.
29. 1.5 n) space. In Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992), pp. 24-29.
30. SADAGOPAN, N., KRISHNAMACHARI, B., AND HELMY, A. Active query forwarding in sensor networks (acquire). Journal of Ad Hoc Networks 3, 1 (January 2005), 91-113.
31. SERVETTO, S. D., AND BARRENECHEA, G. Constrained random walks on random graphs: Routing algorithms for large scale wireless sensor networks. In Proc. of the first ACM Int. workshop on-Wireless sensor networks and applications (2002), ACM Press, pp. 12-21.
32. WAGNER, I. A., LINDENBAUM, M., AND BRUCKSTEIN, A. M. Robotic exploration, brownian motion and electrical resistance. Lecture Notes in Computer Science 1518 (1998), 116-130.
33. ZUCKERMAN, D. Covering times of random walks on bounded degree trees and other graphs. Journal of Theoretical Probability V2, 1 (1989), 147-157.
34. ZUCKERMAN, D. A technique for lower bounding the cover time. In Proc. of the twenty-second annual ACM symposium on Theory of computing (1990), ACM Press, pp. 254-259.