Application of Rayleigh's Short-Cut Method to Polya's Recurrence Problem [PDF]
Library Home || Full Table of Contents || Suggest a Link || Library Help
|Doyle's Ph.D. thesis at Dartmouth College, June 1982. The goals of the presentation are to explain why Polya's theorem is true and to develop techniques for applying Rayleigh's method. The main results make sense of the notion that if two graphs look alike, then random walk is transient on one if and only if it is transient on the other. PostScript and source for this paper are available from Doyle's site.|
|Math Topics:||Graph Theory, Order/Lattices|
© 1994- Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.