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

DOI10.1214/009117907000000694zbMATH Open1068.60072arXivmath/0410171OpenAlexW1636931539MaRDI QIDQ1889795FDOQ1889795

Authors: Pierre Tarrès 

Publication date: 10 December 2004

Published in: The Annals of Probability (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/math/0410171

Recommendations

• Vertex-reinforced random walk on arbitrary graphs
• Vertex-reinforced random walk on \(\mathbb Z\) has finite range
• Vertex-reinforced random walk on \(\mathbb Z\) with sub-square-root weights is recurrent
• A note on vertex-reinforced random walks.
• Vertex-reinforced random walks and a conjecture of Pemantle

zbMATH Keywords

urn modelrandom perturbations of dynamical systemsrepulsive traps

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Combinatorial probability (60C05) Sample path properties (60G17)

Cites Work

• Phase transition in reinforced random walk and RWRE on trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Vertex-reinforced random walks and a conjecture of Pemantle
• Vertex-reinforced random walk on \(\mathbb Z\) has finite range
• Title not available (Why is that?)
• Vertex-reinforced random walk
• Vertex-reinforced random walk on arbitrary graphs
• Pièges répulsifs

Cited In (28)

• Vertex reinforced non-backtracking random walks: an example of path formation
• The directed edge reinforced random walk: the Ant Mill phenomenon
• Limit theorems for reinforced random walks on certain trees
• On recurrence and transience of self-interacting random walks
• Attracting edge and strongly edge reinforced walks
• An asymptotic result for Brownian polymers
• Localization on 5 sites for vertex reinforced random walks: towards a characterization
• Self-Interacting Markov Chains
• A note on vertex-reinforced random walks.
• Stuck walks: a conjecture of Erschler, Tóth and Werner
• Stochastic processes with competing reinforcements
• Vertex-reinforced random walk on \(\mathbb Z\) with sub-square-root weights is recurrent
• VRRW on complete-like graphs: almost sure behavior
• Dynamics of vertex-reinforced random walks
• Mini-workshop: New horizons in motions in random media. Abstracts from the mini-workshop held February 26 -- March 4, 2023
• Recurrence for vertex-reinforced random walks on \(\mathbb Z\) with weak reinforcements.
• Stuck walks
• Phase transition in vertex-reinforced random walks on \({\mathbb{Z}}\) with nonlinear reinforcement
• Random walks in random Dirichlet environment are transient in dimension \(d \geq 3\)
• 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}\)
• Recurrence and transience preservation for vertex reinforced jump processes in one dimension
• Two repelling random walks on \(\mathbb{Z}\)
• Excited Brownian motions as limits of excited random walks
• Strongly vertex-reinforced jump process on a complete graph
• Vertex-reinforced jump process on the integers with nonlinear reinforcement
• Finding geodesics on graphs using reinforcement learning
• Edge-reinforced random walk on a ladder

This page was built for publication: Vertex-reinforced random walk on \(\mathbb Z\) eventually gets stuck on five points.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1889795)