Recurrence for vertex-reinforced random walks on Z with weak reinforcements
Abstract
We prove that any vertex-reinforced random walk on the integer lattice with non-decreasing reinforcement sequence w satisfying w(k) = o(kα) for some α < 1/2 is recurrent. This improves on previous results of Volkov (2006) and Schapira (2012).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.