2016/04/26 by Kious, Daniel, Sidoravicius, Vladas
#60K37 #FOS: Mathematics #Probability (math.PR)
paper · doi:10.48550/arxiv.1604.07631
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 a0 such that the Once-reinforced random walk is almost surely recurrent if a>a0 and almost surely transient if a