Once reinforced random walk on $\mathbb{Z}\times Γ$
Daniel Kious,
Bruno Schapira,
Arvind Singh
Abstract:We revisit Vervoort's unpublished paper [16] on the once reinforced random walk, and prove that this process is recurrent on any graph of the form Z × Γ, with Γ a finite graph, for sufficiently large reinforcement parameter. We also obtain a shape theorem for the set of visited sites, and show that the fluctuations around this shape are of polynomial order. The proof involves sharp general estimates on the time spent on subgraphs of the ambiant graph which might be of independent interest.
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.