Local Times of Subdiffusive Biased Walks on Trees

Abstract

Consider a class of null-recurrent randomly biased walks on a supercritical Galton–Watson tree. We obtain the scaling limits of the local times and the quenched local probability for the biased walk in the subdiffusive 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.