2000 character limit reached
Recurrence and range of the balanced excited random walk M(2,1,2)
Published 24 Sep 2026 in math.PR | (2609.30045v1)
Abstract: We prove that the planar balanced excited random walk is recurrent. This walk takes a horizontal simple random walk step on its first departure from each vertex and a planar simple random walk step on every later departure. Moreover, the number of distinct vertices visited before time , multiplied by , converges to almost surely and in every , $1\le p<\infty$, the same limit as for the planar simple random walk. More generally, we prove recurrence of balanced excited random walks in spatially inhomogeneous cookie environments whenever the total positive and negative cookie strengths at each vertex are bounded by constants with $A+B<1+1/(2π+1)$.
Paper Prompts
Sign up for free to create and run prompts on this paper.