On the speed of once-reinforced biased random walk on trees
From MaRDI portal
Publication:1990217
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.
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
Cites work
- A combinatorial result with applications to self-interacting random walks
- A monotonicity property for random walk in a partially random environment
- An expansion for self-interacting random walks
- Biased random walks on Galton-Watson trees
- Edge-reinforced random walk, vertex-reinforced jump process and the supersymmetric hyperbolic sigma model
- Excited against the tide: a random walk with competing drifts
- General random walk in a random environment defined on Galton-Watson trees
- Localization for linearly edge reinforced random walks
- Lyons‐Pemantle‐Peres Monotonicity Problem for High Biases
- Monotonicity and regularity of the speed for excited random walks in higher dimensions
- Monotonicity for excited random walk in high dimensions
- On strict monotonicity of the speed for excited random walks in one dimension
- On the transience of processes defined on Galton-Watson trees
- Once edge-reinforced random walk on a tree
- Phase transition for the once-reinforced random walk on \(\mathbb{Z}^{d}\)-like trees
- Phase transition in reinforced random walk and RWRE on trees
- Random walks in degenerate random environments
- Reinforced random walk
- Speed of the biased random walk on a Galton-Watson tree
- Transience of edge-reinforced random walk
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)
