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
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
- A monotonicity property for once reinforced biased random walk on \(\mathbb{Z}^d\)
- Speed of the biased random walk on a Galton-Watson tree
- Biased random walks on Galton-Watson trees
- The speed of a biased walk on a Galton-Watson tree without leaves is monotonic with respect to progeny distributions for high values of bias
- A once edge-reinforced random walk on a Galton-Watson tree is transient
Sums of independent random variables; random walks (60G50) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Processes in random environments (60K37)
Cites Work
- An expansion for self-interacting random walks
- Phase transition in reinforced random walk and RWRE on trees
- Reinforced random walk
- Monotonicity and regularity of the speed for excited random walks in higher dimensions
- Excited against the tide: a random walk with competing drifts
- Biased random walks on Galton-Watson trees
- Speed of the biased random walk on a Galton-Watson tree
- A combinatorial result with applications to self-interacting random walks
- Monotonicity for excited random walk in high dimensions
- Random walks in degenerate random environments
- A monotonicity property for random walk in a partially random environment
- Lyons‐Pemantle‐Peres Monotonicity Problem for High Biases
- On the transience of processes defined on Galton-Watson trees
- Edge-reinforced random walk, vertex-reinforced jump process and the supersymmetric hyperbolic sigma model
- Once edge-reinforced random walk on a tree
- Localization for linearly edge reinforced random walks
- Transience of edge-reinforced random walk
- Phase transition for the once-reinforced random walk on \(\mathbb{Z}^{d}\)-like trees
- General random walk in a random environment defined on Galton-Watson trees
- On strict monotonicity of the speed for excited random walks in one dimension
Cited In (8)
- Phase diagram for once-reinforced random walks on trees with exponential weighting scheme
- Speed of the biased random walk on a Galton-Watson tree
- Strongly correlated random interacting processes. Abstracts from the workshop held January 28 -- February 3, 2018
- Phase transition for the once-reinforced random walk on \(\mathbb{Z}^{d}\)-like trees
- On a random walk that grows its own tree
- A monotonicity property for once reinforced biased random walk on \(\mathbb{Z}^d\)
- Once reinforced random walk on \(\mathbb{Z}\times\gamma\)
- The branching-ruin number as critical parameter of random processes on trees
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)