Probability on trees and networks

453Citations
Citations of this article
305Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Lyons, R., & Peres, Y. (2017). Probability on trees and networks. Probability on Trees and Networks (pp. 1–698). Cambridge University Press. https://doi.org/10.1017/9781316672815

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free