Indexed metadata

Recurrence and range of the balanced excited random walk M(2,1,2)

Shuo Qin

Source record

Source: arXiv

Published: Sep 24, 2026

arXiv: 2609.30045

Open original source ↗

Source abstract

We prove that the planar balanced excited random walk M(2,1,2)M(2,1,2) 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 nn, multiplied by (log⁡n)/n(\log n)/n, converges to ππ almost surely and in every LpL^p, 1≤p<∞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 A,BA, B with A+B<1+1/(2π+1)A+B<1+1/(2π+1).

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.