Mathematics – Probability
Scientific paper
2004-10-06
Annals of Probability 2004, Vol. 32, No. 3B, 2650-2701
Mathematics
Probability
Published by the Institute of Mathematical Statistics (http://www.imstat.org) in the Annals of Probability (http://www.imsta
Scientific paper
10.1214/009117907000000694
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.
No associations
LandOfFree
Vertex-reinforced random walk on Z eventually gets stuck on five points does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Vertex-reinforced random walk on Z eventually gets stuck on five points, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Vertex-reinforced random walk on Z eventually gets stuck on five points will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-171339