Stuck walks: A conjecture of Erschler, T\'oth and Werner
Abstract
In this paper, we work on a class of self-interacting nearest neighbor random walks, introduced in [Probab. Theory Related Fields 154 (2012) 149-163], for which there is competition between repulsion of neighboring edges and attraction of next-to-neighboring edges. Erschler, T\'oth and Werner proved in [Probab. Theory Related Fields 154 (2012) 149-163] that, for any L1, if the parameter α belongs to a certain interval (αL+1,αL), then such random walks localize on L+2 sites with positive probability. They also conjectured that this is the almost sure behavior. We prove this conjecture partially, stating that the walk localizes on L+2 or L+3 sites almost surely, under the same assumptions. We also prove that, if α∈(1,+∞)=(α2,α1), then the walk localizes a.s. on 3 sites.
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.