Abstract
AbstractSub‐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. © 2005 Wiley Periodicals, Inc.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
