Abstract
In this paper, we generalize a theorem due to Telcs concerning random walks on infinite graphs, which describes the relation of random walk dimension, fractal dimension and resistance dimension. Moreover, we obtain a reasonable upper bound and lower bound on the hitting time in terms of resistance for some nice graphs. In fact, the conditions given in this paper are weaker than those obtained by A. Telcs.
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
