Efficient distributed random walks with applications

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2010, Pages 201-210

  Sarma, Atish Das ^a   Nanongkai, Danupon ^a   Pandurangan, Gopal ^b,c   Tetali, Prasad ^a  

^a Georgia Institute of Technology   (United States)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^c Brown Univerity   (United States)

Author keywords

Decentralized computation; Distributed algorithms; Mixing time; Random sampling; Random spanning tree; Random walks

Indexed keywords

DECENTRALIZED COMPUTATION; DISTRIBUTED ALGORITHM; MIXING TIME; RANDOM SAMPLING; RANDOM SPANNING TREE; RANDOM WALK;

HIGHWAY ACCIDENTS; PARALLEL ARCHITECTURES; TREES (MATHEMATICS);

ALGORITHMS;

EID: 77956236321     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1835698.1835745     Document Type: Conference Paper

References (33)

1. D. Aldous. The random walk construction of uniform spanning trees and uniform labelled trees. SIAM J. Discrete Math., 3(4):450-465, 1990.
2. R. Aleliunas, R. Karp, R. Lipton, L. Lovasz, and C. Rackoff. Random walks, universal traversal sequences, and the complexity of maze problems. In FOCS, 1979.
3. N. Alon, C. Avin, M. Koucký, G. Kozma, Z. Lotker, and M. R. Tuttle. Many random walks are faster than one. In SPAA, pages 119-128, 2008.
4. H. Baala, O. Flauzac, J. Gaber, M. Bui, and T. A. El-Ghazawi. A self-stabilizing distributed algorithm for spanning tree construction in wireless ad hoc networks. J. Parallel Distrib. Comput., 63(1):97-104, 2003.
5. J. Bar-Ilan and D. Zernik. Random leaders and random spanning trees. In 3rd International Workshop on Distributed Algorithms (later called DISC), 1989.
6. T. Batu, L. Fortnow, E. Fischer, R. Kumar, R. Rubinfeld, and P. White. Testing random variables for independence and identity. In FOCS, pages 442-451, 2001.
7. A. Broder. Generating random spanning trees. In FOCS, 1989.
8. M. Bui, T. Bernard, D. Sohier, and A. Bui. Random walks in distributed computing: A survey. In IICS, pages 1-14, 2004.
9. C. Cooper, A. Frieze, and T. Radzik. Multiple random walks in random regular graphs. In Preprint, 2009.
10. A. Das Sarma, S. Gollapudi, and R. Panigrahy. Estimating pagerank on graph streams. In PODS, pages 69-78, 2008.
11. A. Das Sarma, D. Nanongkai, and G. Pandurangan. Fast distributed random walks. In PODC, pages 161-170, 2009.
12. A. Das Sarma, D. Nanongkai, G. Pandurangan, and P. Tetali. Efficient distributed random walks with applications. CoRR, abs/0911.3195, 2010. URL: http://arxiv.org/abs/0911.3195.
13. D. Dubhashi, F. Grandioni, and A. Panconesi. Distributed algorithms via lp duality and randomization. In Handbook of Approximation Algorithms and Metaheuristics. 2007.
14. M. Elkin. An overview of distributed approximation. ACM SIGACT News Distributed Computing Column, 35(4):40-57, December 2004.
15. M. Elkin. An unconditional lower bound on the time-approximation trade-off for the distributed minimum spanning tree problem. SIAM J. Comput., 36(2):433-456, 2006. Also appeared in STOC'04.
16. R. Elsässer and T. Sauerwald. Tight bounds for the cover time of multiple random walks. In ICALP (1), pages 415-426, 2009.
17. J. Garay, S. Kutten, and D. Peleg. A sublinear time distributed algorithm for minimum-weight spanning trees. SIAM J. Comput., 27:302-316, 1998.
18. C. Gkantsidis, G. Goel, M. Mihail, and A. Saberi. Towards topology aware networks. In IEEE INFOCOM, 2007.
19. N. Goyal, L. Rademacher, and S. Vempala. Expanders via random spanning trees. In SODA, 2009.
20. M. Jerrum and A. Sinclair. Approximating the permanent. SIAM Journal of Computing, 18(6):1149-1178, 1989.
21. J. Kelner and A. Madry. Faster generation of random spanning trees. In IEEE FOCS, 2009.
22. D. Kempe and F. McSherry. A decentralized algorithm for spectral analysis. Journal of Computer and System Sciences, 74(1):70-83, 2008.
23. M. Khan, F. Kuhn, D. Malkhi, G. Pandurangan, and K. Talwar. Efficient distributed approximation algorithms via probabilistic tree embeddings. In PODC, pages 263-272, 2008.
24. M. Khan and G. Pandurangan. A fast distributed approximation algorithm for minimum spanning trees. Distributed Computing, 20:391-402, 2008.
25. S. Kutten and D. Peleg. Fast distributed construction of k-dominating sets and applications. J. Algorithms, 28:40-66, 1998.
26. N. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, San Mateo, CA, 1996.
27. S. Muthukrishnan and G. Pandurangan. The bin-covering technique for thresholding random geometric graph properties. In ACM SODA, 2005. To appear in Journal of Computer and System Sciences.
28. G. Pandurangan and M. Khan. Theory of communication networks. In Algorithms and Theory of Computation Handbook, Second Edition. CRC Press, 2009.
29. D. Peleg. Distributed computing: a locality-sensitive approach. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2000.
30. D. Peleg and V. Rubinovich. A near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction. SIAM J. Comput., 30(5):1427-1442, 2000. Also in FOCS'99.
31. R. Sami and A. Twigg. Lower bounds for distributed markov chain problems. CoRR, abs/0810.5263, 2008.
32. J. S. Vitter. Random sampling with a reservoir. ACM Trans. Math. Softw., 11(1):37-57, 1985. Also in FOCS'83.
33. M. Zhong and K. Shen. Random walk based node sampling in self-organizing networks. Operating Systems Review, 40(3):49-55, 2006.