Stuck walks: a conjecture of Erschler, Tóth and Werner
From MaRDI portal
Publication:282489
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.
Recommendations
- Joint statistics of random walk on \({Z^1}\) and accumulation of visits
- A random walk on \(\mathbb Z\) with drift driven by its occupation time at zero
- The potential function and ladder heights of a recurrent random walk on \(\mathbb{Z}\) with infinite variance
- Multi-excited random walks on integers
- On the range of a constrained random walk
- Simple random walks on radial trees
- The range of stable random walks
- Joint asymptotic behavior of local and occupation times of random walk in higher dimension
- Two-dimensional random walk. From path counting to random interlacements
- scientific article; zbMATH DE number 1064807
Cites work
- scientific article; zbMATH DE number 3538599 (Why is no real title available?)
- scientific article; zbMATH DE number 1944737 (Why is no real title available?)
- A clever (self-repelling) burglar
- A survey of random processes with reinforcement
- Localization of a vertex reinforced random walk on \(\mathbb Z\) with sub-linear weight
- Localization on 4 sites for vertex-reinforced random walks on \(\mathbb{Z}\)
- Marginal densities of the ``true self-repelling motion
- Mathematics for the Analysis of Algorithms.
- Probability. Theory and examples.
- Reinforced random walk
- Reinforced random walk on the \(d\)-dimensional integer lattice
- Some locally self-interacting walks on the integers
- Strongly vertex-reinforced-random-walk on a complete graph
- Stuck walks
- The ``true self-avoiding walk with bond repulsion on \(\mathbb{Z}\): Limit theorems
- The true self-repelling motion
- Vertex-reinforced random walk on \(\mathbb Z\) eventually gets stuck on five points.
- Vertex-reinforced random walk on \(\mathbb Z\) has finite range
- What is the difference between a square and a triangle?
Cited in
(3)
This page was built for publication: Stuck walks: a conjecture of Erschler, Tóth and Werner
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q282489)