Random walks on Galton-Watson trees with random conductances
From MaRDI portal
Publication:424494
DOI10.1016/j.spa.2012.01.004zbMath1255.60178arXiv1101.2769MaRDI QIDQ424494
Serguei Popov, Marina Vachkovskaia, Nina Gantert, Sebastian Müller
Publication date: 1 June 2012
Published in: Stochastic Processes and their Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1101.2769
60K37: Processes in random environments
60J80: Branching processes (Galton-Watson, birth-and-death, etc.)
05C81: Random walks on graphs
Related Items
On the speed of distance stationary sequences, Lyons‐Pemantle‐Peres Monotonicity Problem for High Biases, Speed of the biased random walk on a Galton-Watson tree, Recent progress on the random conductance model, The speed of the tagged particle in the exclusion process on Galton-Watson trees, The speed of random walk on Galton-Watson trees with vanishing conductances, On the speed and spectrum of mean-field random walks among random conductances
Cites Work
- Ergodic theory on stationary random graphs
- A central limit theorem for random walk in a random environment on a marked Galton-Watson tree.
- Weak convergence for the minimal position in a branching random walk: a simple proof
- Random walks and percolation on trees
- Transient random walks in random environment on a Galton-Watson tree
- Anchored expansion, percolation and speed. (With an appendix by Gábor Pete)
- Biased random walks on Galton-Watson trees
- Processes on unimodular random networks
- A central limit theorem for biased random walks on Galton-Watson trees
- Probability on Trees and Networks
- Ergodic theory on Galton—Watson trees: speed of random walk and dimension of harmonic measure
- Anchored expansion and random walk