Abstract
We consider random walks on polynomially growing graphs for which the resistances are also polynomially growing. In this setting we can show the same relation that was found earlier but that needed more complex conditions. The diffusion speed is determined by the geometric and resistance properties of the graph.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
N. Biggs,Algebraic Graph Theory (Cambridge University Press, Cambridge, 1974).
P. Doyle and J. L. Snell,Random Walks and Electric Networks (Carus Mathematical Monographs, 1984).
C. St. J. A. Nash-Williams, Random walks and electric current in networks,Proc. Camb. Phil. Soc. 55:181–194 (1959).
P. M. Soardi and W. Woess, Uniqueness of currents in infinite resistive networks, Universita Degli Studi Di Milano, Dipartimento di Matematica “F. Enriques,” Quadernio 23/1988.
R. Rammal and G. Toulouse, Random walks on fractal structures and percolation clusters,J. Phys. Lett. (Paris) 44:L13-L22 (1983).
A. Telcs, Random walks on graphs, electric networks and fractals,Prob. Theory Related Fields 82:435–499 (1989).
A. Telcs, Spectra of graphs and fractal dimensions I,Prob. Theory Related Fields, submitted.
A. Telcs, Spectra of graphs and fractal dimensions II, to be published.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Telcs, A. A note on recurrent random walks on graphs. J Stat Phys 60, 801–807 (1990). https://doi.org/10.1007/BF01025994
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01025994