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
|
| _version_ | 1826294003335692288 |
|---|---|
| author | Tarres, P |
| author_facet | Tarres, P |
| author_sort | Tarres, P |
| collection | OXFORD |
| description | 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 ℤ. 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. |
| first_indexed | 2024-03-07T03:38:55Z |
| format | Journal article |
| id | oxford-uuid:bd38fbfc-6073-4477-85c6-6f8237fbb635 |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-07T03:38:55Z |
| publishDate | 2004 |
| record_format | dspace |
| spelling | oxford-uuid:bd38fbfc-6073-4477-85c6-6f8237fbb6352022-03-27T05:30:07ZVertex-reinforced random walk on Z eventually gets stuck on five pointsJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:bd38fbfc-6073-4477-85c6-6f8237fbb635EnglishSymplectic Elements at Oxford2004Tarres, PVertex-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 ℤ. 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. |
| spellingShingle | Tarres, P Vertex-reinforced random walk on Z eventually gets stuck on five points |
| title | Vertex-reinforced random walk on Z eventually gets stuck on five points |
| title_full | Vertex-reinforced random walk on Z eventually gets stuck on five points |
| title_fullStr | Vertex-reinforced random walk on Z eventually gets stuck on five points |
| title_full_unstemmed | Vertex-reinforced random walk on Z eventually gets stuck on five points |
| title_short | Vertex-reinforced random walk on Z eventually gets stuck on five points |
| title_sort | vertex reinforced random walk on z eventually gets stuck on five points |
| work_keys_str_mv | AT tarresp vertexreinforcedrandomwalkonzeventuallygetsstuckonfivepoints |