Local times of subdiffusive biased walks on trees
arXiv:1412.4507
Abstract
Consider a class of null-recurrent randomly biased walks on a super-critical Gaton-Watson tree. We obtain the rates of convergence of the local times and the quenched local probability for the biased walk in the sub-diffusive case. These results are a consequence of a sharp estimate on the return time, whose analysis is driven by a family of concave recursive equations on trees.
arXiv commentI am grateful to Pierre Rousselin who has kindly pointed out a mistake in the original version. In this corrected version, the case kappa>2 remains unchanged, but the results in the cases (1 < kappa <= 2) are weaker than that stated in the original version: we only obtain the rates of convergence instead of the exact equivalence with an explicit constant
References in corpus (6)
- A survey of max-type recursive distributional equations
- Dynamics of trap models
- Almost sure convergence for stochastically biased random walks on trees
- The critical Ising model on trees, concave recursions and nonlinear capacity
- Large deviations for random walks in random environment on a Galton-Watson tree
- Biased random walks on a Galton-Watson tree with leaves