Recurrence for vertex-reinforced random walks on Z with weak reinforcements
classification
🧮 math.PR
keywords
alpharandomvertex-reinforcedimprovesintegerlatticenon-decreasingprevious
read the original abstract
We prove that any vertex-reinforced random walk on the integer lattice with non-decreasing reinforcement sequence $w$ satisfying $w(k) = o(k^{\alpha})$ for some $\alpha < 1/2$ is recurrent. This improves on previous results of Volkov (2006) and Schapira (2012).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.