# Euler Tour Lock-In Problem in the Rotor-Router Model

## Abstract

The *rotor-router model*, also called the *Propp machine*, was first considered as a deterministic alternative to the random walk. It is known that the route in an undirected graph *G* = (*V*,*E*), where |*V*| = *n* and |*E*| = *m*, adopted by an agent controlled by the rotor-router mechanism forms eventually an Euler tour based on arcs obtained via replacing each edge in *G* by two arcs with opposite direction. The process of ushering the agent to an Euler tour is referred to as the *lock-in problem*. In recent work [11] Yanovski et al. proved that independently of the initial configuration of the rotor-router mechanism in *G* the agent locks-in in time bounded by 2*mD*, where *D* is the diameter of *G*.

In this paper we examine the dependence of the lock-in time on the initial configuration of the rotor-router mechanism. The case study is performed in the form of a game between a player \(\cal P\) intending to lock-in the agent in an Euler tour as quickly as possible and its adversary \(\cal A\) with the counter objective. First, we observe that in certain (easy) cases the lock-in can be achieved in time *O*(*m*). On the other hand we show that if adversary \(\cal A\) is solely responsible for the assignment of ports and pointers, the lock-in time Ω(*m*·*D*) can be enforced in any graph with *m* edges and diameter *D*. Furthermore, we show that if \(\cal A\) provides its own port numbering after the initial setup of pointers by \(\cal P\), the complexity of the lock-in problem is bounded by *O*(*m* · min {log*m*,*D*}). We also propose a class of graphs in which the lock-in requires time Ω(*m* ·log*m*). In the remaining two cases we show that the lock-in requires time Ω(*m* ·*D*) in graphs with the worst-case topology. In addition, however, we present non-trivial classes of graphs with a large diameter in which the lock-in time is *O*(*m*).

## Keywords

Random Walk Undirected Graph Edge Incident Complete Bipartite Graph Port Number## Preview

Unable to display preview. Download preview PDF.

## References

- 1.Aldous, D., Fill, J.: Reversible Markov Chains and Random Walks on Graphs (2001), http://stat-www.berkeley.edu/users/aldous/RWG/book.html
- 2.Afek, Y., Gafni, E.: Distributed Algorithms for Unidirectional Networks. SIAM Journal on Computing 23(6), 1152–1178 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
- 3.Bhatt, S., Even, S., Greenberg, D., Tayar, R.: Traversing Directed Eulerian Mazes. Journal of Graph Algorithms and Applications 6(2), 157–173 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
- 4.Cooper, C., Ilcinkas, D., Klasing, R., Kosowski, A.: Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Niko-letsea, S. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 411–422. Springer, Heidelberg (2009)Google Scholar
- 5.Cooper, J.N., Spencer, J.: Simulating a random walk with constant error. Combinatorics, Probability and Computing 15, 815–822 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
- 6.Doerr, B., Friedrich, T.: Deterministic Random Walks on the Two-Dimensional Grid. Combinatorics, Probability and Computing 18(1-2), 123–144 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
- 7.Fraenkel, A.S.: Economic traversal of labyrinths. Mathematics Magazine 43, 125–130 (1970)MathSciNetCrossRefzbMATHGoogle Scholar
- 8.Gąsieniec, L., Radzik, T.: Memory efficient anonymous graph exploration. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds.) WG 2008. LNCS, vol. 5344, pp. 14–29. Springer, Heidelberg (2008)CrossRefGoogle Scholar
- 9.Priezzhev, V.B., Dhar, D., Dhar, A., Krishnamurthy, S.: Eulerian walkers as a model of selforganized criticality. Physics Review Letters 77, 5079–5082 (1996)CrossRefGoogle Scholar
- 10.Strahler, A.N.: Hypsometric (area-altitude) analysis of erosional topography. Geological Society of America Bulletin 63(11), 1117–1142 (1952)CrossRefGoogle Scholar
- 11.Yanovski, V., Wagner, I.A., Bruckstein, A.M.: A Distributed Ant Algorithm for Efficiently Patrolling a Network. Algorithmica 37, 165–186 (2003)MathSciNetCrossRefzbMATHGoogle Scholar