An invariance principle and a large deviation principle for the biased random walk on
From MaRDI portal
Publication:5109503
DOI10.1017/jpr.2019.92zbMath1434.60187OpenAlexW3021037109MaRDI QIDQ5109503
Yuelin Liu, Longmin Wang, Kai-Nan Xiang, Vladas Sidoravićius
Publication date: 12 May 2020
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/jpr.2019.92
Central limit and other weak theorems (60F05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Large deviations (60F10) Random walks on graphs (05C81)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Einstein relation for biased random walk on Galton-Watson trees
- Speed of the biased random walk on a Galton-Watson tree
- Biased random walks on Galton-Watson trees with leaves
- Random walks on the lamplighter group
- Random walks and percolation on trees
- On the Markov chain central limit theorem
- Recent advances in invariance principles for stationary sequences
- Approximate counting, uniform generation and rapidly mixing Markov chains
- Random walks, capacity and percolation on trees
- Biased random walks on Galton-Watson trees
- Uniform spanning forests on biased Euclidean lattices
- The most visited sites of biased random walks on trees
- Probability on Trees and Networks
- Bounds on the L 2 Spectrum for Markov Chains and Markov Processes: A Generalization of Cheeger's Inequality
- Biased random walks on random graphs
- A quenched central limit theorem for biased random walks on supercritical Galton–Watson trees
- Probability
This page was built for publication: An invariance principle and a large deviation principle for the biased random walk on