Abstract
We prove that Vertex Reinforced Random Walk on with weight of order , with , is either almost surely recurrent or almost surely transient. This improves a previous result of Volkov who showed that the set of sites which are visited infinitely often was a.s. either empty or infinite.
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.