Abstract
We establish general estimates for simple random walk on an arbitrary infinite random graph, assuming suitable bounds on volume and effective resistance for the graph. These are generalizations of the results in Barlow et al. (Commun. Math. Phys. 278:385-431, 2008, Sects. 1, 2) and in particular imply the spectral dimension of the random graph. We will also give an application of the results to random walk on a long-range percolation cluster.
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
