Advertisement

Probability on Trees: An Introductory Climb

  • Yuval Peres
Chapter
Part of the Lecture Notes in Mathematics book series (LNM, volume 1717)

Abstract

  • 1. Preface

  • 2. Basic Definitions and a Few Highlights

  • 3. Galton-Watson Trees

  • 4. General percolation on a connected graph

  • 5. The First-Moment Method

  • 6. Quasi-independent Percolation

  • 7. The Second Moment Method

  • 8. Electrical Networks

  • 9. Infinite Networks

  • 10. The Method of Random Paths

  • 11. Transience of Percolation Clusters

  • 12. Subperiodic Trees

  • 13. The Random Walks \({\rm RW}_\lambda\)

  • 14. Capacity

  • 15. Intersection-Equivalence

  • 16. Reconstruction for the Ising Model on a Tree

  • 17. Unpredictable Paths in Z and EIT inZ2

  • 18. Tree-Indexed Processes

  • 19. Recurrence for Tree-Indexed Markov Chains

  • 20. Dynamical Percolation

  • 21. Stochastic Domination Between Trees

Mathematics Subject Classification (1991):

60-01 60-06 60D05 60G17 60G18 60J15 60J30 60K35 82,-01 82B20 82B26 82B44 82C05 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin/Heidelberg 1999

Authors and Affiliations

  • Yuval Peres
    • 1
  1. 1.Institute of MathematicsHebrew UniversityJerusalemIsraël

Personalised recommendations