pith. sign in

arxiv: 1412.4507 · v2 · pith:D3F3IBN2new · submitted 2014-12-15 · 🧮 math.PR

Local times of subdiffusive biased walks on trees

classification 🧮 math.PR
keywords biasedlocaltimestreeswalksanalysiscaseclass
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.