Vertex-reinforced random walk on Z eventually gets stuck on five points
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 latt...
Main Author: | |
---|---|
Format: | Journal article |
Language: | English |
Published: |
2004
|