Abstract
We consider the problem of exploring an anonymous undirected graph using an oblivious robot. The studied exploration strategies are designed so that the next edge in the robot’s walk is chosen using only local information, and so that some local equity (fairness) criterion is satisfied for the adjacent undirected edges. Such strategies can be seen as an attempt to derandomize random walks, and are natural undirected counterparts of the rotor-router model for symmetric directed graphs.
The first of the studied strategies, known as Oldest-First (OF), always chooses the neighboring edge for which the most time has elapsed since its last traversal. Unlike in the case of symmetric directed graphs, we show that such a strategy in some cases leads to exponential cover time. We then consider another strategy called Least-Used-First (LUF) which always uses adjacent edges which have been traversed the smallest number of times. We show that any Least-Used-First exploration covers a graph G = (V,E) of diameter \(\mathit{D}\) within time \(O(\mathit{D}|E|)\), and in the long run traverses all edges of G with the same frequency.
The research was partially funded by the KBN (Poland) Grant 4 T11C 047 25, by the ANR projects “ALADDIN” and “ALPAGE”, by the INRIA project “CEPAGE”, and by European COST Action Action 295 “Dynamic Communication Networks” (DYNAMO).
Chapter PDF
References
Aldous, D., Fill, J.: Reversible Markov Chains and Random Walks on Graphs (2001), 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 sequences and the complexity of maze problems. In: Proceedings of the 20th Annual IEEE Symposium on the Foundations of Computer Science (FOCS 1979), pp. 218–223 (1979)
Bender, M.A., Fernández, A., Ron, D., Sahai, A., Vadhan, S.P.: The power of a pebble: Exploring and mapping directed graphs. Information and Computation 176(1), 1–21 (2002)
Bhatt, S.N., Even, S., Greenberg, D.S., Tayar, R.: Traversing directed eulerian mazes. Journal of Graph Algorithms and Applications 6(2), 157–173 (2002)
Cooper, J., Doerr, B., Friedrich, T., Spencer, J.: Deterministic Random Walks on Regular Trees. In: Proceedings of 19th ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), pp. 766–772 (2008)
Deng, X., Papadimitriou, C.H.: Exploring an Unknown Graph. Journal of Graph Theory 32(3), 265–297 (1999)
Doerr, B., Friedrich, T.: Deterministic Random Walks on the Two-Dimensional Grid. Combinatorics, Probability and Computing (to appear, 2009), doi:10.1017/S0963548308009589
Fraigniaud, P., Ilcinkas, D., Peer, G., Pelc, A., Peleg, D.: Graph exploration by a finite automaton. Theoretical Computer Science 345(2-3), 331–344 (2005)
Gąsieniec, L., Pelc, A., Radzik, T., Zhang, X.: Tree exploration with logarithmic memory. In: Proceedings 19th ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 585–594 (2007)
Hemmerling, A.: Labyrinth Problems: Labyrinth-Searching Abilities of Automata. Teubner-Texte zur Mathematik 114 (1989)
Ikeda, S., Kubo, I., Yamashita, M.: The hitting and cover times of random walks on finite graphs using local degree information. Theoretical Computer Science 410(1), 94–100 (2009)
Kahn, J., Kim, J.H., Lovász, L., Vu, V.H.: The cover time, the blanket time, and the Matthews bound. In: Proceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS 2000), pp. 467–475. IEEE, Los Alamitos (2000)
Koenig, S.: Complexity of Edge Counting. In: Goal-Directed Acting with Incomplete Information. Technical Report CMU-CS-97-199, Carnegie Mellon University (1997)
Koenig, S., Simmons, R.G.: Easy and Hard Testbeds for Real-Time Search Algorithms. In: Proceedings of the National Conference on Artificial Intelligence, pp. 279–285 (1996)
Koucký, M.: Universal traversal sequences with backtracking. Journal of Computer and System Sciences 65(4), 717–726 (2002)
Lovász, L.: Random walks on graphs: A survey. Bolyai Society Mathematical Studies 2, 353–397 (1996)
Reingold, O.: Undirected ST-connectivity in log-space. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), pp. 376–385 (2005)
Saks, M.E.: Randomization and derandomization in space-bounded computation. In: Proceedings of the 11th Annual IEEE Conference on Computational Complexity, pp. 128–149 (1996)
Wagner, I.A., Lindenbaum, M., Bruckstein, A.M.: Smell as a Computational Resource — a Lesson We Can Learn from the Ants. In: Proceedings of Fourth Israeli Symposium on Theory of Computing and Systems (ISTCS 1996), pp. 219–230 (1996)
Wagner, I.A., Lindenbaum, M., Bruckstein, A.M.: Distributed Covering by Ant-Robots Using Evaporating Traces. IEEE Transactions on Robotics and Automation 15(5), 918–933 (1999)
Winkler, P., Zuckerman, D.: Multiple cover time. Random Structures and Algorithms 9(4), 403–411 (1996)
Yanovski, V., Wagner, I.A., Bruckstein, A.M.: A Distributed Ant Algorithm for Efficiently Patrolling a Network. Algorithmica 37, 165–186 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cooper, C., Ilcinkas, D., Klasing, R., Kosowski, A. (2009). Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds) Automata, Languages and Programming. ICALP 2009. Lecture Notes in Computer Science, vol 5556. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02930-1_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-02930-1_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02929-5
Online ISBN: 978-3-642-02930-1
eBook Packages: Computer ScienceComputer Science (R0)