Interpolating between random walk and rotor walk

Abstract

We introduce a family of stochastic processes on the integers, depending on a parameter p ∈ [0,1] and interpolating between the deterministic rotor walk (p=0) and the simple random walk (p=1/2). This p-rotor walk is not a Markov chain but it has a local Markov property: for each x ∈ Z the sequence of successive exits from x is a Markov chain. The main result of this paper identifies the scaling limit of the p-rotor walk with two-sided i.i.d. initial rotors. The limiting process takes the form 1-pp X(t), where X is a doubly perturbed Brownian motion, that is, it satisfies the implicit equation equation X(t) = B(t) + a s≤ t X(s) + b ∈fs≤ t X(s) equation for all t ∈ [0,∞). Here B(t) is a standard Brownian motion and a,b<1 are constants depending on the marginals of the initial rotors on N and -N respectively. Chaumont and Doney [CD99] have shown that the above equation has a pathwise unique solution X(t), and that the solution is almost surely continuous and adapted to the natural filtration of the Brownian motion. Moreover, X(t) = +∞ and X(t) = -∞ [CDH00]. This last result, together with the main result of this paper, implies that the p-rotor walk is recurrent for any two-sided i.i.d. initial rotors and any 0<p<1.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…