Book contents
- Frontmatter
- PREFACE
- Contents
- PART I RANDOM WALKS ON FINITE NETWORKS
- PART II RANDOM WALKS ON INFINITE NETWORKS
- CHAPTER 5 PÓLYA'S RECURRENCE PROBLEM
- CHAPTER 6 RAYLEIGH'S SHORT-CUT METHOD
- CHAPTER 7 THE CLASSICAL PROOFS OF PÓLYA'S THEOREM
- CHAPTER 8 RANDOM WALKS ON MORE GENERAL INFINITE NETWORKS
- REFERENCES
- INDEX
CHAPTER 8 - RANDOM WALKS ON MORE GENERAL INFINITE NETWORKS
from PART II - RANDOM WALKS ON INFINITE NETWORKS
- Frontmatter
- PREFACE
- Contents
- PART I RANDOM WALKS ON FINITE NETWORKS
- PART II RANDOM WALKS ON INFINITE NETWORKS
- CHAPTER 5 PÓLYA'S RECURRENCE PROBLEM
- CHAPTER 6 RAYLEIGH'S SHORT-CUT METHOD
- CHAPTER 7 THE CLASSICAL PROOFS OF PÓLYA'S THEOREM
- CHAPTER 8 RANDOM WALKS ON MORE GENERAL INFINITE NETWORKS
- REFERENCES
- INDEX
Summary
![Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'](https://static.cambridge.org/content/id/urn%3Acambridge.org%3Aid%3Abook%3A9781614440222/resource/name/firstPage-9781614440222c8_p131-150_CBO.jpg)
- Type
- Chapter
- Information
- Random Walks and Electric Networks , pp. 131 - 150Publisher: Mathematical Association of AmericaPrint publication year: 1984