pith. sign in

arxiv: 1604.07631 · v2 · pith:NEIO2RPQnew · submitted 2016-04-26 · 🧮 math.PR

Phase transition for the Once-reinforced random walk on mathbb{Z}^d-like trees

classification 🧮 math.PR
keywords randomwalkonce-reinforcedtreesalmostparameterphasesurely
0
0 comments X
read the original abstract

In this short paper, we consider the Once-reinforced random walk with reinforcement parameter $a$ on trees with bounded degree which are transient for the simple random walk. On each of these trees, we prove that there exists an explicit critical parameter $a_0$ such that the Once-reinforced random walk is almost surely recurrent if $a>a_0$ and almost surely transient if $a<a_0$. This provides the first examples of phase transition for the Once-reinforced random walk.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.