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.

This publication has 46 references indexed in Scilit: