Atish Das Sarma
Danupon Nanongkai
ABSTRACT
We focus on the problem of performing random walks efficiently in a distributed network. Given bandwidth constraints, the goal is to minimize the number of rounds required to obtain a random walk sample. We first present a fast sublinear time distributed algorithm for performing random walks whose time complexity is sublinear in the length of the walk. Our algorithm performs a random walk of length l in Õ(√l D) rounds (with high probability) on an undirected network, where D is the diameter of the network. This improves over the previous best algorithm that ran in Õ(l2/3D1/3) rounds (Das Sarma et al., PODC 2009). We further extend our algorithms to efficiently perform k independent random walks in Õ(√kl D + k) rounds. We then show that there is a fundamental difficulty in improving the dependence on l any further by proving a lower bound of Ω(√l/log l + D) under a general model of distributed random walk algorithms. Our random walk algorithms are useful in speeding up distributed algorithms for a variety of applications that use random walks as a subroutine. We present two main applications. First, we give a fast distributed algorithm for computing a random spanning tree (RST) in an arbitrary (undirected) network which runs in Õ(√mD) rounds (with high probability; here m is the number of edges). Our second application is a fast decentralized algorithm for estimating mixing time and related parameters of the underlying network. Our algorithm is fully decentralized and can serve as a building block in the design of topologically-aware networks.
- D. Aldous. The random walk construction of uniform spanning trees and uniform labelled trees. SIAM J. Discrete Math., 3(4):450--465, 1990. Google Scholar
Digital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- J. Bar-Ilan and D. Zernik. Random leaders and random spanning trees. In 3rd International Workshop on Distributed Algorithms (later called DISC), 1989. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- A. Broder. Generating random spanning trees. In FOCS, 1989. Google ScholarDigital Library
- M. Bui, T. Bernard, D. Sohier, and A. Bui. Random walks in distributed computing: A survey. In IICS, pages 1--14, 2004. Google ScholarDigital Library
- C. Cooper, A. Frieze, and T. Radzik. Multiple random walks in random regular graphs. In Preprint, 2009.Google Scholar
- A. Das Sarma, S. Gollapudi, and R. Panigrahy. Estimating pagerank on graph streams. In PODS, pages 69--78, 2008. Google ScholarDigital Library
- A. Das Sarma, D. Nanongkai, and G. Pandurangan. Fast distributed random walks. In PODC, pages 161--170, 2009. Google ScholarDigital Library
- 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.Google Scholar
- D. Dubhashi, F. Grandioni, and A. Panconesi. Distributed algorithms via lp duality and randomization. In Handbook of Approximation Algorithms and Metaheuristics. 2007.Google Scholar
- M. Elkin. An overview of distributed approximation. ACM SIGACT News Distributed Computing Column, 35(4):40--57, December 2004. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- R. Elsässer and T. Sauerwald. Tight bounds for the cover time of multiple random walks. In ICALP (1), pages 415--426, 2009. Google ScholarDigital Library
- J. Garay, S. Kutten, and D. Peleg. A sublinear time distributed algorithm for minimum-weight spanning trees. SIAM J. Comput., 27:302--316, 1998. Google ScholarDigital Library
- C. Gkantsidis, G. Goel, M. Mihail, and A. Saberi. Towards topology aware networks. In IEEE INFOCOM, 2007.Google ScholarDigital Library
- N. Goyal, L. Rademacher, and S. Vempala. Expanders via random spanning trees. In SODA, 2009. Google ScholarDigital Library
- M. Jerrum and A. Sinclair. Approximating the permanent. SIAM Journal of Computing, 18(6):1149--1178, 1989. Google ScholarDigital Library
- J. Kelner and A. Madry. Faster generation of random spanning trees. In IEEE FOCS, 2009. Google ScholarDigital Library
- D. Kempe and F. McSherry. A decentralized algorithm for spectral analysis. Journal of Computer and System Sciences, 74(1):70--83, 2008. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- M. Khan and G. Pandurangan. A fast distributed approximation algorithm for minimum spanning trees. Distributed Computing, 20:391--402, 2008.Google ScholarCross Ref
- S. Kutten and D. Peleg. Fast distributed construction of k-dominating sets and applications. J. Algorithms, 28:40--66, 1998. Google ScholarDigital Library
- N. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, San Mateo, CA, 1996. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- G. Pandurangan and M. Khan. Theory of communication networks. In Algorithms and Theory of Computation Handbook, Second Edition. CRC Press, 2009.Google Scholar
- D. Peleg. Distributed computing: a locality-sensitive approach. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2000. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- R. Sami and A. Twigg. Lower bounds for distributed markov chain problems. CoRR, abs/0810.5263, 2008.Google Scholar
- J. S. Vitter. Random sampling with a reservoir. ACM Trans. Math. Softw., 11(1):37--57, 1985. Also in FOCS'83. Google ScholarDigital Library
- M. Zhong and K. Shen. Random walk based node sampling in self-organizing networks. Operating Systems Review, 40(3):49--55, 2006 Google ScholarDigital Library
Index Terms
- Efficient distributed random walks with applications
Recommendations
Fast distributed random walks
PODC '09: Proceedings of the 28th ACM symposium on Principles of distributed computingPerforming random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we focus on the problem of performing random walks efficiently in a distributed ...
Distributed Random Walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this article, we focus on the problem of sampling random walks efficiently in a distributed ...
Efficient random walk sampling in distributed networks
Performing random walks in networks is a fundamental primitive that has found numerous applications in communication networks such as token management, load balancing, network topology discovery and construction, search, and peer-to-peer membership ...
Comments