Abstract
In this paper, we generalize a result of Nash-Williams concerning recurrence of locally finite networks, by extending his result to networks with possibly vertices of infinite degree.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Cox, D. R., and Miller, H. D. (1965).The Theory of Stochastic Processes, Chapman and Hall, London and New York.
Doyle, P. G., and Snell, J. L. (1984).Random Walks and Electric Networks, Carus Mathematical Monographs, 22.
Feller, W. (1957).An Introduction to Probability Theory and Its Applications, Vols. I and II, 2nd ed., John Wiley and Sons, New York.
Foster, F. G. (1952). On Markov chains with an enumerable infinity of states,Proc. Camb. Phil. Soc. 48, 587–591.
Griffeath, D., and Liggett, R. M. (1982). Critical phenomena for Spitzer's reversible nearest particle systems,Ann. Prob. 10, 881–895.
Lyons, T. (1983). A simple criterion for transience of a reversible Markov chai,Ann. Prob. 11, 393–402.
McGuinness, S. (1989).Random Walks on Graphs and Directed Graphs, Ph.D. thesis, University of Waterloo.
Nash-Williams, C. St. J. A. (1959). Random walk and electric currents in networks,Proc. Camb. Phil. Soc. 55, 181–195.
Royden, H. L. (1968).Real Analysis, 2nd ed., MacMillan, New York.
Thomassen, C. (1990). Resistances and currents in infinite electrical networks,J. Comb. Theor. B. 49, 87–102.
Author information
Authors and Affiliations
Additional information
Work completed at the University of Waterloo and at the University of Milan.
Rights and permissions
About this article
Cite this article
McGuinness, S. Recurrent networks and a theorem of Nash-Williams. J Theor Probab 4, 87–100 (1991). https://doi.org/10.1007/BF01046995
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01046995