Textbook in PDF format

Starting around the late 1950s, several research communities began relating the geometry of graphs to stochastic processes on these graphs. This book, twenty years in the making, ties together research in the field, encompassing work on percolation, isoperimetric inequalities, eigenvalues, transition probabilities, and random walks. Written by two leading researchers, the text emphasizes intuition, while giving complete proofs and more than 850 exercises. Many recent developments, in which the authors have played a leading role, are discussed, including percolation on trees and Cayley graphs, uniform spanning forests, the mass-transport technique, and connections on random walks on graphs to embedding in Hilbert space. This state-of-the-art account of probability on networks will be indispensable for graduate students and researchers alike.
Preface.
Some Highlights.
Random Walks and Electric Networks.
Special Networks.
Uniform Spanning Trees.
Branching Processes, Second Moments, and Percolation.
Isoperimetric Inequalities.
Percolation on Transitive Graphs.
The Mass-Transport Technique and Percolation.
Infinite Electrical Networks and Dirichlet Functions.
Uniform Spanning Forests.
Minimal Spanning Forests.
Limit Theorems for Galton–Watson Processes.
Escape Rate of Random Walks and Embeddings.
Random Walks on Groups and Poisson Boundaries.
Hausdorff Dimension.
Capacity and Stochastic Processes.
Random Walks on Galton–Watson Trees.
Comments on Exercises.
Bibliography.
Glossary of Notation.
Index