scientific article; zbMATH DE number 7799674
From MaRDI portal
Publication:6146316
arXiv1905.00821MaRDI QIDQ6146316
Publication date: 5 February 2024
Full work available at URL: https://arxiv.org/abs/1905.00821
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sums of independent random variables; random walks (60G50) Strong limit theorems (60F15) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) (L^p)-limit theorems (60F25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Speed of the biased random walk on a Galton-Watson tree
- A central limit theorem for random walk in a random environment on a marked Galton-Watson tree.
- Random walks and percolation on trees
- 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 walk in a random environment and first-passage percolation on trees
- Random walks, capacity and percolation on trees
- Sur certaines martingales de Benoit Mandelbrot
- On generalized multiplicative cascades
- Range and critical generations of a random walk on Galton-Watson trees
- Invariant measures, Hausdorff dimension and dimension drop of some harmonic measures on Galton-Watson trees
- Resistance growth of branching random networks
- Scaling limit of the recurrent biased random walk on a Galton-Watson tree
- Biased random walks on Galton-Watson trees
- Almost sure convergence for stochastically biased random walks on trees
- Scaling limit of the subdiffusive random walk on a Galton-Watson tree in random environment
- The number of generations entirely visited for recurrent random walks in a random environment
- Harmonic measure for biased random walk in a supercritical Galton-Watson tree
- Local times of subdiffusive biased walks on trees
- Effective resistance of random trees
- Probability on Trees and Networks
- Ergodic theory on Galton—Watson trees: speed of random walk and dimension of harmonic measure
This page was built for publication: