On the speed of once-reinforced biased random walk on trees

From MaRDI portal
Publication:1990217

DOI10.1214/18-EJP208zbMATH Open1417.60085arXiv1702.01982OpenAlexW2606396207MaRDI QIDQ1990217FDOQ1990217


Authors: Yanyan Li Edit this on Wikidata


Publication date: 25 October 2018

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

Abstract: We study the asymptotic behaviour of once-reinforced biased random walk (ORbRW) on Galton-Watson trees. Here the underlying (unreinforced) random walk has a bias towards or away from the root. We prove that in the setting of multiplicative once-reinforcement the ORbRW can be recurrent even when the underlying biased random walk is ballistic. We also prove that, on Galton-Watson trees without leaves, the speed is positive in the transient regime. Finally, we prove that, on regular trees, the speed of the ORbRW is monotone decreasing in the reinforcement parameter when the underlying random walk has high speed, and the reinforcement parameter is small.


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




Recommendations




Cites Work


Cited In (8)





This page was built for publication: On the speed of once-reinforced biased random walk on trees

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