Vertex-reinforced random walk is a random process which visits a site with probability proportional to the weight w k of the number k of previous visits. We show that if w k ∼ k α, then there is a large time T 0 such that after T 0 the walk visits 2, 5, or ∞ sites when α < 1, = 1, or > 1, respectively. More general results are also proven.
Similar content being viewed by others
References
Dai J.J. (2004). Some results regarding vertex-reinforced random walks. Stat. Probab. Lett. 66, 259–266
Dai J.J. (2003). A note on vertex-reinforced random walks. Stat. Probab. Lett. 62, 275–280
Davis B. (1990). Reinforced random walk. Probab. Theory. Relat. Fields 84, 203–229
Khanin K., Khanin R. (2001). A probabilistic model for establishing of neuron polarity. J. Math. Biol. 42, 26–40
Kingman J.F.C., Volkov S. (2003). Solution to the OK Corral model via decoupling of Friedman’s urn. J. Theory. Probab. 16, 267–276
Pemantle R. (1992) Vertex-reinforced random walk. Probab. Theory Relat. Fields 92, 117–136
Pemantle R., Volkov S. (1999). Vertex-reinforced random walk on \({\mathbb{Z}}\) has finite range. Ann. Probab. 27, 1368–1388
Pemantle, P. (2002). Random processes with reinforcement. Preprint, http://www.math. upenn.edu/~pemantle/papers/Papers.html
Shiryaev, A. N. (1996). Probability. Translated from the first (1980) Russian edition by R. P. Boas., 2nd ed. Graduate Texts in Mathematics, Springer-Verlag, New York.
Tarrès P. (2004). Vertex-reinforced random walk on \({\mathbb{Z}}\) eventually gets stuck on five points. Ann. Probab. 32, 2650–2701
Volkov S. (2001). Vertex-reinforced random walk on arbitrary graphs. Ann. Probab. 29, 66–91
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Volkov, S. Phase Transition in Vertex-Reinforced Random Walks on \({\mathbb{Z}}\) with Non-linear Reinforcement. J Theor Probab 19, 691–700 (2006). https://doi.org/10.1007/s10959-006-0033-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10959-006-0033-2