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.
| Original language | English |
|---|---|
| Pages (from-to) | 1642-1677 |
| Number of pages | 36 |
| Journal | Communications on Pure and Applied Mathematics |
| Volume | 58 |
| Issue number | 12 |
| DOIs | |
| Publication status | Published - 1 Dec 2005 |
| Externally published | Yes |