Vertex-reinforced random walk on Z eventually gets stuck on five points

Abstract

Vertex-reinforced random walk (VRRW), defined by Pemantle in 1988, is a random process that takes values in the vertex set of a graph G, which is more likely to visit vertices it has visited before. Pemantle and Volkov considered the case when the underlying graph is the one-dimensional integer lattice Z. They proved that the range is almost surely finite and that with positive probability the range contains exactly five points. They conjectured that this second event holds with probability 1. The proof of this conjecture is the main purpose of this paper.

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

References in corpus (1)

• A survey of random processes with reinforcement

Cited by in corpus (21)

• An asymptotic result for Brownian polymers
• Random walks in random Dirichlet environment are transient in dimension $d\ge 3$
• Attracting edge and strongly edge reinforced walks
• Reinforcement learning in signaling game
• Reinforced walks in two and three dimensions
• Linearly edge-reinforced random walks
• Edge-reinforced random walk on a ladder
• Localization of reinforced random walks
• Dynamics of vertex-reinforced random walks
• Strongly Vertex-Reinforced-Random-Walk on the complete graph
• Edge-reinforced random walk, Vertex-Reinforced Jump Process and the supersymmetric hyperbolic sigma model
• Recurrence for vertex-reinforced random walks on Z with weak reinforcements
• VRRW on complete-like graphs: Almost sure behavior
• Strongly vertex-reinforced jump process on a complete graph
• Reverting Processes
• Stuck walks: A conjecture of Erschler, Tóth and Werner
• Localization on 5 sites for vertex reinforced random walks: Towards a characterization
• Vertex-reinforced jump process on the integers with nonlinear reinforcement
• Two repelling random walks on $\mathbb{Z}$
• A Class of Multi-particle Reinforced Interacting Random Walks
• Limit theorems for vertex-reinforced jump processes on regular trees