Stuck walks: A conjecture of Erschler, Tóth 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óth and Werner proved in [Probab. Theory Related Fields 154 (2012) 149-163] that, for any $L\ge 1$, if the parameter $\alpha$ belongs to a certain interval $({\alpha }_{L+1},{\alpha }_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 $\alpha \in (1,+\infty )=({\alpha }_2,{\alpha }_1)$, then the walk localizes a.s. on $3$ sites.

Published at http://dx.doi.org/10.1214/14-AOP991 in the Annals of Probability (http://www.imstat.org/aop/) by the Institute of Mathematical Statistics (http://www.imstat.org)

References in corpus (5)

• A survey of random processes with reinforcement
• Vertex-reinforced random walk on Z eventually gets stuck on five points
• Localization of reinforced random walks
• Strongly Vertex-Reinforced-Random-Walk on the complete graph
• A clever (self-repelling) burglar

Cited by in corpus (1)

• Attraction properties for general urn processes and applications to a class of interacting reinforced particle systems