Some basic properties of a rotor-router model with i.i.d. initial rotor-routers on the line

Abstract

The rotor-router model is a class of deterministic processes on graphs which can simulate the random walks. In this model, each vertex has a rotor-router which indicates the walker's movement. Every walker moves on the graph following the rotor-router's instructions. In this paper, we propose a model with independent and identically distributed initial rotor-routers on the line. We show limit theorems for the total time spent in the positive side and negative side of the line.