Noga Alon
ABSTRACT
We pose a new and intriguing question motivated by distributed computing regarding random walks on graphs: How long does it take for several independent random walks, starting from the same vertex, to cover an entire graph? We study the cover time - the expected time required to visit every node in a graph at least once - and we show that for a large collection of interesting graphs, running many random walks in parallel yields a speed-up in the cover time that is linear in the number of parallel walks. We demonstrate that an exponential speed-up is sometimes possible, but that some natural graphs allow only a logarithmic speed-up. A problem related to ours (in which the walks start from some probablistic distribution on vertices) was previously studied in the context of space efficient algorithms for undirected s-t-connectivity and our results yield, in certain cases, an improvement upon some of the earlier bounds.
- Alanyali, M., Saligrama, V., and Sava, O. A random-walk model for distributed computation in energy-limited network. In In Proc. of 1st Workshop on Information Theory and its Application (San Diego, 2006).]]Google Scholar
- Aldous, D. J. On the time taken by random on finite groups to visit every state. Z. Wahrsch. Verw. Gebiete 62, 3 (1983), 361--374.]]Google ScholarCross Ref
- 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.]]Google ScholarCross Ref
- Aldous, D. J. Threshold limits for cover times. Journal of Theoretical Probability V4, 1 (1991), 197--211.]]Google ScholarCross Ref
- 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.]] Google ScholarDigital Library
- Alon, N. Eigenvalues and expanders. Combinatorica 6, 2 (1986), 83--96.]] Google ScholarDigital Library
- Armoni, R., Ta-Shma, A., Wigderson, A., and Zhou, S. A (log n )4 3 space algorithm for ( t ) connectivity in undirected graphs. Journal of the ACM 47, 2 (2000), 294--311.]] Google ScholarDigital Library
- 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.]] Google ScholarDigital Library
- 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.]] Google ScholarDigital Library
- 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.]] Google ScholarDigital Library
- 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.]] Google ScholarDigital Library
- 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.]] Google ScholarDigital Library
- Broder, A., and Karlin, A. Bounds on the cover time. J. Theoret. Probab. 2 (1989), 101--120.]]Google ScholarCross Ref
- 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.]] Google ScholarDigital Library
- Chandra, A. K., Raghavan, P., Ruzzo, 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.]] Google ScholarDigital Library
- 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-03) (Baltimore, Maryland, USA, 2003), ACM Press, pp. 140--147.]] Google ScholarDigital Library
- 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.]] Google ScholarDigital Library
- Feige, U. A tight lower bound on the cover time for random walks on graphs. Random Structures and Algorithms 6, 4 (1995), 433--438.]]Google Scholar
- Feige, U. A tight upper bound on the cover time for random walks on graphs. Random Structures and Algorithms 6, 1 (1995), 51--54.]]Google Scholar
- Feige, U. Short random walks on graphs. SIAM Journal on Discrete Mathematics 1, 9 (1996), 19--28.]] Google ScholarDigital Library
- Gkantsidis, C., Mihail, 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).]]Google Scholar
- 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.]] Google ScholarDigital Library
- 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.]] Google ScholarDigital Library
- Jonasson, J. On the cover time for random walks on random graphs. Comb. Probab. Comput. 7, 3 (1998), 265--279.]] Google ScholarDigital Library
- Jonasson, J., and Schramm, O. On the cover time of planar graphs. Electronic Communications in Probability 5 (2000), 85--90.]]Google ScholarCross Ref
- Karger, D. R., Nisan, N., and Parnas, M. Fast connected components algorithms for the EREW PRAM. SIAM J. Comput. 28, 3 (1999), 1021--1034.]] Google ScholarDigital Library
- Lovász, L. Random walks on graphs: A survey. In Combinatorics, Paul Erdös is eighty, Vol. 2 (Keszthely, 1993), vol. 2 of Bolyai Soc. Math. Stud. János Bolyai Math. Soc., Budapest, 1996, pp. 353--397.]]Google Scholar
- Matthews, P. Covering problems for brownian motion on spheres. Ann. Probab. 16, 1 (1988), 189--199.]]Google ScholarCross Ref
- Nisan, N., Szemerédi, E., and Wigderson, A. Undirected connectivity in O (log 1 5n ) space. In Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992), pp. 24--29.]] Google ScholarDigital Library
- 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.]]Google ScholarCross Ref
- 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.]] Google ScholarDigital Library
- 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.]] Google ScholarDigital Library
- Zuckerman, D. Covering times of random walks on bounded degree trees and other graphs. Journal of Theoretical Probability V2, 1 (1989), 147--157.]]Google ScholarCross Ref
- Zuckerman, D. A technique for lower bounding the cover time. In Proc. of the twenty-second annual ACM 127 symposium on Theory of computing (1990), ACM Press, pp. 254--259.]] Google ScholarDigital Library
Index Terms
- Many random walks are faster than one
Recommendations
The cover times of random walks on random uniform hypergraphs
Random walks in graphs have been applied to various network exploration and network maintenance problems. In some applications, however, it may be more natural, and more accurate, to model the underlying network not as a graph but as a hypergraph, and ...
Fast Random Walks on Finite Graphs and Graph Topological Information
ICNC '11: Proceedings of the 2011 Second International Conference on Networking and ComputingA random walk on a graph is a process in which a particle on a vertex repeatedly moves to its adjacent vertex according to transition probability, which is given in advance. The behavior of random walks depend on its transition probability, and the ``...
Better Bounds for Coalescing-Branching Random Walks
Special Issue on SPAA 2016Coalescing-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 timestep, a subset of ...
Comments