The rotor-router mechanism was introduced as a deterministic alternative to the random
walk in undirected graphs. In this model, a set of k identical walkers is deployed in parallel …

We study the cover time of multiple walks in a graph following the rotor-router mechanism.
This mechanism can be seen as a derandomization of multiple random walks, in which …

Random walks on graphs are an essential primitive for many randomised algorithms and
stochastic processes. It is natural to ask how much can be gained by running multiple …

The rotor-router model, also called the Propp machine, was introduced as a deterministic
alternative to the random walk. In this model, a group of identical tokens are initially placed …

The rotor–router model, also called the Propp machine, was first considered as a
deterministic alternative to the random walk. The edges adjacent to each node v (or …

We consider the model of exploration of an undirected graph G by a single agent which is
called the rotor-router mechanism or the Propp machine (among other names). Let π v …

The rotor-router model, also called the Propp machine, was introduced as a deterministic
alternative to the random walk. In this model, a group of identical tokens are initially placed …

Random walks are frequently used in randomized algorithms. We study a derandomized
variant of a random walk on graphs, called rotor-router model. In this model, instead of …

Computing with mobile agents is rapidly becoming a topic of mainstream research in the
theory of distributed computing. The main research questions undertaken in this study …

We study the problem of online tree exploration by a deterministic mobile agent. Our main
objective is to establish what features of the model of the mobile agent and the environment …