The speed of a biased random walk on a Galton-Watson tree is analytic
From MaRDI portal
Publication:2201544
DOI10.1214/20-ECP344zbMath1469.60269arXiv2006.03433MaRDI QIDQ2201544
Publication date: 29 September 2020
Published in: Electronic Communications in Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.03433
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Processes in random environments (60K37) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Random walks on graphs (05C81)
Cites Work
- Unnamed Item
- Einstein relation for biased random walk on Galton-Watson trees
- Speed of the biased random walk on a Galton-Watson tree
- Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
- Biased random walks on Galton-Watson trees with leaves
- Slowdown estimates and central limit theorem for random walks in random environment
- Large deviations for random walks on Galton-Watson trees: Averaging and uncertainty
- Central limit theorems for biased randomly trapped random walks on \(\mathbb{Z}\)
- 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
- Escape regimes of biased random walks on Galton-Watson trees
- A central limit theorem for biased random walks on Galton-Watson trees
- Random Walks and Heat Kernels on Graphs
- Biased random walks on random graphs
- A quenched central limit theorem for biased random walks on supercritical Galton–Watson trees
- Differentiability of the speed of biased random walks on Galton-Watson trees
- Lyons‐Pemantle‐Peres Monotonicity Problem for High Biases
- Phase Transition for the Speed of the Biased Random Walk on the Supercritical Percolation Cluster
This page was built for publication: The speed of a biased random walk on a Galton-Watson tree is analytic
