Abstract
We prove that any vertex-reinforced random walk on the integer lattice with non-decreasing reinforcement sequence satisfying for some is recurrent. This improves on previous results of Volkov (2006) and Schapira (2012).
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.