Abstract
Sub-Gaussian estimates for random walks are typical of fractal graphs. We characterize them in the strongly recurrent case, in terms of resistance estimates only, without assuming elliptic Harnack inequalities.
Users
Please
log in to take part in the discussion (add own reviews or comments).