Probability on Trees and Networks
Published on 22. December 2016
978-1-316-78661-1 (ISBN)
Description
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.
Reviews / Votes
'This long-awaited work focuses on one of the most interesting and important parts of probability theory. Half a century ago, most work on models such as random walks, Ising, percolation and interacting particle systems concentrated on processes defined on the d-dimensional Euclidean lattice. In the intervening years, interest has broadened dramatically to include processes on more general graphs, with trees being a particularly important case. This led to new problems and richer behavior, and as a result, to the development of new techniques. The authors are two of the major developers of this area; their expertise is evident throughout.' Thomas M. Liggett, University of California, Los Angeles 'Masterly, beautiful, encyclopaedic, and yet browsable - this great achievement is obligatory reading for anyone working near the conjunction of probability and network theory.' Geoffrey Grimmett, University of Cambridge 'For the last ten years, I have not let a doctoral student graduate without reading this [work]. Sadly, the earliest of those students are missing a considerable amount of material that the bound and published edition contains. Not only are the classical topics of random walks, electrical theory, and uniform spanning trees covered in more coherent fashion than in any other source, but this book is also the best place to learn about a number of topics for which the other choices for textual material are limited. These include mass transport, random walk boundaries, and dimension and capacity in the context of Markov processes.' Robin Pemantle, University of Pennsylvania 'Lyons and Peres have done an amazing job of motivating their material and of explaining it in a conversational and accessible fashion. Even though the book emphasizes probability on infinite graphs, it is one of my favorite references for probability on finite graphs. If you want to understand random walks, isoperimetry, random trees, or percolation, this is where you should start.' Daniel Spielman, Yale University, Connecticut 'This long-awaited book offers a splendid account of several major areas of discrete probability. Both authors have made outstanding contributions to the subject, and the exceptional quality of the book is largely due to their high level of mastery of the field. Although the only prerequisites are basic probability theory and elementary Markov chains, the book succeeds in providing an elegant presentation of the most beautiful and deepest results in the various areas of probability on graphs. The powerful techniques that made these results available, such as the use of isoperimetric inequalities or the mass-transport principle, are also presented in a detailed and self-contained manner. This book will be indispensable to any researcher working in probability on graphs and related topics, and it will also be a must for anybody interested in the recent developments of probability theory.' Jean-Francois Le Gall, Universite Paris-Sud 'This is a very timely book about a circle of actively developing subjects in discrete probability. No wonder that it became very popular two decades before publication, while still in development. Not only a comprehensive reference source, but also a good textbook to learn the subject, it will be useful for specialists and newcomers alike.' Stanislav Smirnov, Universite of Geneve 'A glorious labor of love, compiled over more than two decades of work, that brilliantly surveys the deep and expansive relationships between random trees and other areas of mathematics. Rarely does one encounter a text so exquisitely well written or enjoyable to read. One cannot take more than a few steps in modern probability without encountering one of the topics surveyed here. A truly essential resource.' Scott Sheffield, Massachusetts Institute of Technology 'There is much to be learned from studying this book. Many of the ideas and tools are useful in a wide variety of different contexts ... Geoff Grimmett's quote on the cover calls the book 'Masterly, beautiful, encyclopedic and yet browsable.' I totally agree. Even though it is freely available on the web, you should buy a copy of the book.' Richard Durrett, Mathematical Association of America Reviews (www.maa.org) 'This is a monumental book covering a lot of interesting problems in discrete probability, written by two experts in the field ... The authors have done a great job of providing full proofs of all main results, hence creating a self-contained reference in this area.' Abbas Mehrabian, Zentralblatt MATH 'This long-awaited book, a project that started in 1993, is bound to be the main reference in the fascinating field of probability on trees and weighted graphs. The authors are the leading experts behind the tremendous developments experienced in the subject in recent decades, where the underlying networks evolved from classical lattices to general graphs ... This pedagogically written book is a marvelous support for several courses on topics from combinatorics, Markov chains, geometric group theory, etc., as well as on their inspiring relationships. The wealth of exercises (with comments provided at the end of the book) will enable students and researchers to check their understanding of this fascinating mathematics.' Laurent Miclo, MathSciNetMore details
Series
Language
English
Place of publication
Cambridge
United Kingdom
Publishing group
Cambridge University Press
Target group
Professional and scholarly
Illustrations
Worked examples or Exercises; 4 Tables, black and white; 13 Line drawings, color; 78 Line drawings, black and white
File size
82,19 MB
ISBN-13
978-1-316-78661-1 (9781316786611)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
Russell Lyons | Yuval Peres
Probability on Trees and Networks
Book
01/2017
Cambridge University Press
€90.30
Shipment within 15-20 days
Persons
Russell Lyons is James H. Rudy Professor of Mathematics at Indiana University, Bloomington. He obtained his PhD at the University of Michigan in 1983. He has written seminal papers concerning probability on trees and random spanning trees in networks. Lyons was a Sloan Foundation Fellow and has been an Invited Speaker at the International Congress of Mathematicians and the Joint Mathematics Meetings. He is a Fellow of the American Mathematical Society. Yuval Peres is a Principal Researcher at Microsoft Research in Redmond, Washington. He obtained his PhD at the Hebrew University, Jerusalem in 1990 and later served on their faculty as well as on the faculty at the University of California, Berkeley. He has written more than 250 research papers in probability, ergodic theory, analysis, and theoretical computer science. He has coauthored books on Brownian motion and Markov chain mixing times. Peres was awarded the Rollo Davidson Prize in 1995, the Loeve Prize in 2001, and the David P. Robbins Prize in 2011 and was an Invited Speaker at the 2002 ICM. He is a fellow of the American Mathematical Society and a foreign associate member of the US National Academy of Sciences.
Content
1. Some highlights; 2. Random walks and electric networks; 3. Special networks; 4. Uniform spanning trees; 5. Branching processes, second moments, and percolation; 6. Isoperimetric inequalities; 7. Percolation on transitive graphs; 8. The mass-transport technique and percolation; 9. Infinite electrical networks and Dirichlet functions; 10. Uniform spanning forests; 11. Minimal spanning forests; 12. Limit theorems for Galton-Watson processes; 13. Escape rate of random walks and embeddings; 14. Random walks on groups and Poisson boundaries; 15. Hausdorff dimension; 16. Capacity and stochastic processes; 17. Random walks on Galton-Watson trees.
