Stuck walks: A conjecture of Erschler, T\'oth and Werner
Daniel Kious

TL;DR
This paper investigates a class of self-interacting random walks, proving that they almost surely localize on either L+2 or L+3 sites under certain conditions, partially confirming a previous conjecture.
Contribution
It proves the conjecture that such walks localize on L+2 or L+3 sites almost surely, extending prior results and providing new localization conditions.
Findings
Walks localize on L+2 or L+3 sites almost surely.
For α > 1, walks localize on exactly 3 sites.
Partial proof of a conjecture by Erschler, Toth, 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\'{o}th and Werner proved in [Probab. Theory Related Fields 154 (2012) 149-163] that, for any , if the parameter belongs to a certain interval , then such random walks localize on 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 or sites almost surely, under the same assumptions. We also prove that, if , then the walk localizes a.s. on sites.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
