Recurrence for vertex-reinforced random walks on Z with weak reinforcements

preprint2014arXivOpen access

Abstract

We prove that any vertex-reinforced random walk on the integer lattice with non-decreasing reinforcement sequence ww satisfying w(k)=o(kα)w(k) = o(k^α) for some α<1/2α< 1/2 is recurrent. This improves on previous results of Volkov (2006) and Schapira (2012).

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.