**Probability on Trees and Networks**

by Russell Lyons, Yuval Peres

**Publisher**: Cambridge University Press 2016**ISBN/ASIN**: 1107160154**ISBN-13**: 9781107160156**Number of pages**: 716

**Description**:

This book is concerned with certain aspects of discrete probability on infinite graphs that are currently in vigorous development. Of course, finite graphs are analyzed as well, but usually with the aim of understanding infinite graphs and networks.

Download or read it online for free here:

**Download link**

(20MB, PDF)

## Similar books

**Advanced Graph Theory and Combinatorial Optimization**

by

**Alexander Schrijver**

From the table of contents: Shortest trees and branchings; Matchings and covers; Edge-colouring; Multicommodity flows and disjoint paths; Matroids; Perfect matchings in regular bipartite graphs; Minimum circulation of railway stock.

(

**11260**views)

**An Introduction to Combinatorics and Graph Theory**

by

**David Guichard**-

**Whitman College**

The book covers the classic parts of Combinatorics and graph theory, with some recent progress in the area. Contents: Fundamentals; Inclusion-Exclusion; Generating Functions; Systems of Distinct Representatives; Graph Theory; Polya-Redfield Counting.

(

**8143**views)

**Graph Theory**

by

**Reinhard Diestel**-

**Springer**

Textbook on graph theory that covers the basics, matching, connectivity, planar graphs, colouring, flows, substructures in sparse graphs, Ramsey theory for graphs, hamiltonian cycles, random graphs, minors, trees, and WQO.

(

**20094**views)

**Introductory Map Theory**

by

**Yanpei Liu**-

**Kapa & Omega**

As an introductory book, this book contains the elementary materials in map theory, including embeddings of a graph, abstract maps, duality, orientable and non-orientable maps, isomorphisms of maps and the enumeration of rooted or unrooted maps.

(

**7743**views)