Abstract
Motivated by real world networks and use of algorithms based on random walks on these networks we study the simple random walks on dynamic undirected graphs with fixed underlying vertex set, i.e., graphs which are modified by inserting or deleting edges at every step of the walk. We are interested in the expected time needed to visit all the vertices of such a dynamic graph, the cover time, under the assumption that the graph is being modified by an oblivious adversary. It is well known that on connected static undirected graphs the cover time is polynomial in the size of the graph. On the contrary and somewhat counter-intuitively, we show that there are adversary strategies which force the expected cover time of a simple random walk on connected dynamic graphs to be exponential. We relate this result to the cover time of static directed graphs. In addition we provide a simple strategy, the lazy random walk, that guarantees polynomial cover time regardless of the changes made by the adversary.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alanyali, M., Saligrama, V., Sava, O.: A random-walk model for distributed computation in energy-limited network. In: Proc. of 1st Workshop on Information Theory and its Application, San Diego (2006)
Aldous, D., Fill, J.: Reversible Markov Chains and Random Walks on Graphs (unpublished, 1999), http://stat-www.berkeley.edu/users/aldous/RWG/book.html
Aleliunas, R., Karp, R.M., Lipton, R.J., Lovász, L., 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, pp. 218–223. IEEE, New York (1979)
Alon, N., Avin, C., Koucký, M., Kozma, G., Lotker, Z., Tuttle, M.R.: Many random walks are faster than one. In: 20th ACM Symposium on Parallelism in Algorithms and Architectures (to appear, 2008)
Avin, C., 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, pp. 277–286 (2004)
Avin, C., Koucký, M., Lotker, Z.: How to explore a fast-changing world. Tech. Rep. pre-116, Institute of Mathematics of the Academy of Sciences of the Czech Republic (2007), http://www.math.cas.cz/preprint/pre-116.pdf
Cooper, C., Frieze, A.: Crawling on simple models of web graphs. Internet Mathematics 1, 57–90 (2003)
Feige, U.: A tight lower bound on the cover time for random walks on graphs. Random Structures and Algorithms 6(4), 433–438 (1995)
Feige, U.: A tight upper bound on the cover time for random walks on graphs. Random Structures and Algorithms 6(1), 51–54 (1995)
Ferreira, A.: Building a reference combinatorial model for manets. Network, IEEE 18(5), 24–29 (2004)
Ferreira, A., Goldman, A., Monteiro, J.: On the evaluation of shortest journeys in dynamic networks. In: Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007), pp. 3–10 (2007)
Gkantsidis, C., Mihail, M., Saberi, A.: Random walks in peer-to-peer networks. In: INFOCOM 2004. Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 1, p. 130 (2004)
Henzinger, M., Heydon, A., Mitzenmacher, M., Najork, M.: Measuring index quality using random walks on the Web. WWW8 / Computer Networks 31(11-16), 1291–1303 (1999)
Jarry, A., Lotker, Z.: Connectivity in evolving graph with geometric properties. In: DIALM-POMC 2004: Proceedings of the 2004 Joint Workshop on Foundations of Mobile Computing, NY, USA, pp. 24–30. ACM Press, New York (2004)
Jerrum, M., Sinclair, A.: Approximating the permanent. SIAM Journal on Computing 18(6), 1149–1178 (1989)
Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: Proc. of the 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 482–491 (2003)
Lovász, L.: Random walks on graphs: A survey. In: Combinatorics, Paul Erdos is eighty, Keszthely, vol. 2 (1993); Bolyai Soc. Math. Stud. János Bolyai Math. Soc., Budapest, 2, 353–397 (1996)
Sadagopan, N., Krishnamachari, B., Helmy, A.: Active query forwarding in sensor networks (acquire). Journal of Ad Hoc Networks 3(1), 91–113 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Avin, C., Koucký, M., Lotker, Z. (2008). How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs). In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds) Automata, Languages and Programming. ICALP 2008. Lecture Notes in Computer Science, vol 5125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70575-8_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-70575-8_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70574-1
Online ISBN: 978-3-540-70575-8
eBook Packages: Computer ScienceComputer Science (R0)