Probability on Trees and Networks
This book is still being written. All parts that are available are in
close-to-finished form. Bibliographic
references are not yet complete; feel free to help. We expect that
the final product
will be published by Cambridge University Press. However, we do not have a
definite date for completion of the manuscript. When the book is done, that
will be clearly noted here. Meanwhile, please do not ask Cambridge
University Press how to obtain the book.
A few of the authors' results and proofs appear here for the first time.
At this point, almost all of the actual writing was done by Lyons.
We hope to have a more balanced
co-authorship eventually.
Please let us know of any errors you find. In addition,
suggestions for improvement of any sort,
including exercises at any level, are welcome; please send them to
rdlyons@indiana.edu or
to peres [at] microsoft [dot] com.
You may wish to use the following if you refer to this book in a paper.
Note in particular the correct method to get TeX to print a tilde.
\bibitem[Lyons with Peres (2012)]{LP:book}
\bibauthor{Lyons, R. {\rm with} Peres, Y.} (2012).
\newblock {\em Probability on Trees and Networks}.
\newblock Cambridge University Press.
\newblock In preparation. Current
version available at \hfil\break
{\tt http://mypage.iu.edu/\string~rdlyons/}.
Downloads and Extras:
Chapter Titles:
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 Principle and Percolation
Infinite Electrical Networks and Dirichlet Functions
Uniform Spanning Forests
Minimal Spanning Forests
Limit Theorems for Galton-Watson Processes
Speed of Random Walks
Hausdorff Dimension
Capacity
Random Walks on Galton-Watson Trees
Tree-Indexed Processes (to be written)
Ising Models and Recursions (to be written)
Comments on Exercises
Bibliography
Index
Glossary of Notation
Information on updates:
1 Nov. 1996: First version
16 Nov. 1996: Added the chapter on random spanning forests, which is not
yet complete.
17 Nov. 1996: Very slight changes.
27 Nov. 1996: Small changes.
8 Dec. 1996: Reorganization of the chapter on random spanning trees,
small changes to the chapter on electrical networks, and other minor
changes.
27 Dec. 1996: Changes to the chapters on electrical networks,
random spanning trees, and random spanning forests. This included making
the coboundary operator the negative of its former self and introducing
more Hilbert-space techniques.
10 Jan. 1997: Yuval Peres joined as coauthor. Changes to the chapters on
random spanning trees and random spanning forests.
22 May 1997: Changes to the chapters on random walks and electric
networks, random spanning trees, random spanning forests, and speed. New
chapter begun on isoperimetric inequalities.
22 Nov. 1997: New title, as scope is expanding. Nicer version available on
the web.
22 Sep. 1998: Slightly updated preface.
12 May 1999: Various small corrections throughout.
17 May 1999: Hyperlinks added. These can be used if your PS viewer supports
them.
15 June 2000: Small corrections made in various places.
20 Sep. 2000: New chapter on percolation added.
19 Dec. 2000: Reorganized order of chapters.
New chapter on Dirichlet functions created from material in
the chapter on random spanning forests. Some new results added in the
chapters on percolation on transitive graphs and on isoperimetric
inequalities. A few corrections in other places.
16 April 2001: There is some new material throughout, including some new
sections. The most significant changes occurred in Sections 3.2, 3.5, 5.1,
6.11, 6.13, 7.3, 8.4, 8.5, 8.8, 12.4, and 12.5. There are other small
changes throughout, especially to avoid ambiguity of notation.
24 Sep. 2001: PDF file available. Notation revised for electrical
quantities and hence for vertices. Several corrections to first 4 chapters.
A small amount of new material in first 2 chapters.
30 Oct. 2001: Small improvements in various places, especially in Chapters
4--5.
16 Nov. 2001: Small improvements and corrections in Chapters 5--6.
22 Nov. 2001: Uniqueness monotonicity for general quasi-transitive graphs
added. Split Chapter 6 in two, the first not needing the Mass-Transport
Principle and the second devoted to the Mass-Transport Principle.
28 Nov. 2001: Minor corrections and changes in Chapters 6--7.
20 Dec. 2001: Minor corrections and changes in Chapters 2--8.
14 Mar. 2002: Small corrections to Chapters 5 and 8.
10 Apr. 2002: Small additions to Chapters 8 and 9.
1 August 2003: Minor corrections, improvements, and updates.
21 Dec. 2003: Minor corrections.
19 March 2004: Minor corrections.
11 April 2004: Minor corrections.
1 Sep. 2004: Minor improvements in Chap. 2.
8 Sep. 2004: Minor improvements in Chaps. 1 and 2.
14 Sep. 2004: Minor improvements in Chap. 2.
16 Sep. 2004: Minor improvements in Chap. 2.
22 Sep. 2004: Minor improvements in Chaps. 2 and 3.
27 Sep. 2004: Minor improvements in Chaps. 2 and 3.
29 Sep. 2004: Minor improvements in Chap. 2.
1 Oct. 2004: Minor improvements in Chaps. 3, 5, 8, and 9.
6 Oct. 2004: Minor improvements in Chaps. 2 and 3.
24 Oct. 2004: Minor improvements in Chaps. 2, 3, and 8.
25 Oct. 2004: Minor improvements in Chaps. 2 and 3.
30 Oct. 2004: Minor improvements in Chaps. 2, 3 and 5, including a large
number of new exercises in Chap. 3.
1 Nov. 2004: Minor improvements in Chaps. 2 and 3.
4 Nov. 2004: Minor improvements in Chaps. 2, 3 and 6.
22 Nov. 2004: Minor improvements in Chaps. 2, 7 and 8.
9 Dec. 2004: Minor improvements in Chap. 8.
9 Jan. 2005: Significant additions in Chap. 9.
24 Jan. 2005: Improvements in Chap. 9.
7 Feb. 2005: Improvements in Chap. 9.
15 Feb. 2005: Improvements in Chap. 9.
21 Feb. 2005: Improvements in Chap. 9.
23 Feb. 2005: Minor improvements in Chap. 9.
28 Feb. 2005: Minor improvements in Chap. 9.
7 Mar. 2005: Minor improvements in Chaps. 3, 5, and 9.
20 Mar. 2005: Minor improvements in Chaps. 2 and 9.
4 Apr. 2005: Beginning of new chapter, 10, on minimal spanning forests.
12 Apr. 2005: More added to Chap. 10.
17 Apr. 2005: More added to Chap. 10 and a little to Chap. 6.
18 April 2008: Material added in various places. Minor improvements
throughout. Chapter on random walks split in two. Re-ordered some chapters.
21 Sep. 2008: Bookmarks added to the pdf.
7 Jan. 2009: Improvements throughout, especially new sections on entropy and
on speed of random walks.
2 Feb. 2009: Improvements throughout.
14 May 2009: Minor improvements throughout.
18 June 2009: Small additions, especially a section on the Gaussian
network, and minor improvements throughout.
15 July 2009: Minor corrections in the first 7 chapters.
4 Sep. 2009: Addition of index, more complete glossary of notation,
and minor corrections throughout.
25 Nov. 2009: Better treatment of percolation on quasi-transitive
unimodular graphs in Chap. 8 and minor corrections in Chapters 2-8.
5 Feb. 2010: Minor corrections and improvements in Chapters 2-9.
24 Feb. 2010: Minor corrections and improvements in Chapters 2-11.
11 Mar. 2010: Minor corrections and improvements in Chapters 2-10.
15 Mar. 2010: Minor improvements to the exercises in Chapter 2.
1 Apr. 2010: Minor corrections and improvements in Chapters 2, 4, and 8.
30 Apr. 2010: Minor corrections and improvements in Chapters 2 and 9-12.
Chapter dependency diagram added to the preface.
8 May 2010: Added new sections in each chapter that collect the in-text
exercises.
13 May 2010: Minor changes, including some new and improved figures.
28 May 2010: Minor improvements.
29 May 2010: Minor improvements.
17 June 2010: Minor improvements and new figures. Some figures were
compressed because the file was getting bloated, so higher-resolution
versions are available above.
27 June 2010: Minor improvements.
14 July 2010: Minor improvements.
17 July 2010: Minor improvements.
7 August 2010: Minor improvements.
15 August 2010: Minor improvements.
15 Sep. 2010: Minor improvements.
4 Oct. 2010: Minor improvements, including moving the sections from Chap.
13 concerning random walk on random trees to Chap. 16.
20 Oct. 2010: Minor improvements.
22 Oct. 2010: Minor improvements.
27 Oct. 2010: Minor improvements.
31 Oct. 2010: Minor improvements in Chap. 2.
2 Nov. 2010: Minor improvements in Chap. 2.
12 Nov. 2010: Minor improvements, especially in Chaps. 3, 5, and 9.
19 Nov. 2010: Minor improvements, especially in Chaps. 2, 3, 4, 9, 14, and
15.
19 Nov. 2010: Minor improvements, especially in Chap. 4.
2 Dec. 2010: Minor improvements, especially in Chaps. 5 and 15.
22 Dec. 2010: Minor improvements in Chap. 16.
30 Dec. 2010: Minor improvements in Chap. 6.
14 Mar. 2011: Minor improvements throughout.
18 Mar. 2011: Minor improvements mostly in Chap. 8.
11 July 2011: Minor improvements and a new section explaining von Neumann
dimension and the first l2-Betti number in Chap. 10.
13 July 2011: Minor improvements in the new section explaining von Neumann
dimension and the first l2-Betti number in Chap. 10.
21 July 2011: Minor improvements mostly in Chap. 7.
24 July 2011: Minor improvements mostly in Chap. 8.
7 Aug. 2011: Minor improvements mostly in Chap. 9.
28 Aug. 2011: Minor improvements mostly in Chap. 10, and Sections 2.7
(the Gaussian network) and 13.5 (Hilbert distortion).
24 Dec. 2011: Minor improvements mostly in Chaps. 11-16, and a new Section
6.3 on non-backtracking walks.