Biased random walks on Galton-Watson trees with leaves
From MaRDI portal
Publication:662434
DOI10.1214/10-AOP620zbMath1239.60091arXiv0711.3686MaRDI QIDQ662434
Gérard Ben Arous, Alexander Fribergh, Alan Hammond, Nina Gantert
Publication date: 22 February 2012
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0711.3686
infinitely divisible distributions; Galton-Watson tree; electrical networks; random walk in random environment
60E07: Infinitely divisible distributions; stable distributions
60F05: Central limit and other weak theorems
60K37: Processes in random environments
60J80: Branching processes (Galton-Watson, birth-and-death, etc.)
Related Items
A quenched central limit theorem for biased random walks on supercritical Galton–Watson trees, Biased random walks on random graphs, An invariance principle and a large deviation principle for the biased random walk on, Non-Gaussian fluctuations of randomly trapped random walks, 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, Limit theorem for sub-ballistic random walks in Dirichlet environment in dimension \(d \geq 3\), Stable limit laws for randomly biased walks on supercritical trees, Biased random walk on critical Galton-Watson trees conditioned to survive, Slow movement of a random walk on the range of a random walk in the presence of an external field, Speed of the biased random walk on a Galton-Watson tree, Central limit theorems for biased randomly trapped random walks on \(\mathbb{Z}\), Scaling limits for sub-ballistic biased random walks in random conductances, Almost sure convergence for stochastically biased random walks on trees, The speed of a biased random walk on a percolation cluster at high density, Mean-field analysis of a scaling MAC radio protocol, The Tutte embedding of the mated-CRT map converges to Liouville quantum gravity, The speed of random walk on Galton-Watson trees with vanishing conductances, Biased random walk on supercritical percolation: anomalous fluctuations in the ballistic regime, The tail of the length of an excursion in a trap of random size, Biased random walk on the trace of biased random walk on the trace of \(\dots\), The speed of a biased random walk on a Galton-Watson tree is analytic, The speed of biased random walk among random conductances, Local times of subdiffusive biased walks on trees, Escape regimes of biased random walks on Galton-Watson trees, Scaling limit for the ant in a simple high-dimensional labyrinth, Biased random walk in positive random conductances on \(\mathbb{Z}^{d}\), The speed of critically biased random walk in a one-dimensional percolation model, Biased random walk on spanning trees of the ladder graph, Randomly biased walks on subcritical trees
Cites Work
- Stable limit laws for randomly biased walks on supercritical trees
- Limit laws for transient random walks in random environment on \(\mathbb Z\)
- A subdiffusive behaviour of recurrent random walk in random environment on a regular tree
- Transient random walks in random environment on a Galton-Watson tree
- Random walks, capacity and percolation on trees
- The speed of biased random walk on percolation clusters
- On the anisotropic walk on the supercritical percolation cluster
- A law of large numbers for random walks in random environment
- Biased random walks on Galton-Watson trees
- Transition from the annealed to the quenched asymptotics for a random walk on random obstacles
- A probabilistic representation of constants in Kesten's renewal theorem
- A central limit theorem for biased random walks on Galton-Watson trees
- Probability on Trees and Networks
- Randomly biased walks on subcritical trees
- Course 4 Random motions in random media
- Course 8 Dynamics of trap models
- On a Necessary and Sufficient Condition That an Infinitely Divisible Distribution be Absolutely Continuous
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item