Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Barlow et al. (2005) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: