A 0-1 law for vertex-reinforced random walks on Z with weight of order k^,\;[0,1/2)

From MaRDI portal
Publication:428753

DOI10.1214/ECP.V17-2084zbMATH Open1244.60033arXiv1107.2505OpenAlexW2082599717MaRDI QIDQ428753FDOQ428753


Authors: Bruno Schapira Edit this on Wikidata


Publication date: 22 June 2012

Published in: Electronic Communications in Probability (Search for Journal in Brave)

Abstract: We prove that Vertex Reinforced Random Walk on mathbbZ with weight of order kalpha, with alphain[0,1/2), 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.


Full work available at URL: https://arxiv.org/abs/1107.2505




Recommendations





Cited In (6)





This page was built for publication: A 0-1 law for vertex-reinforced random walks on \(\mathbb{Z}\) with weight of order \(k^\alpha,\;\alpha\in[0,1/2)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q428753)