"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-François Le Gall, Université Paris-Sud.
Probability on Trees and Networks