Recurrence/Transience criteria for excited random walks with finite-drift cookie stacks
Abstract
We consider excited random walk (ERW) on Z in environments with identical stacks of infinitely many cookies at each site, subject to the constraint that the total drift per site δ = Σ (2pj - 1) is finite. Building on the methods of Kozma, Orenshtein, and Shinkar (arXiv:1311.7439), we show that ERW in finite-drift environments is recurrent when |δ|<1 and transient when |δ|>1. In the case |δ|=1 we prove that ERW is recurrent under mild assumptions on the environment. In addition, we show that ERW may be transient when |δ|=1, an interesting new behavior that was not present in previously studied models.
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.