Online Public Access Catalogue (OPAC)
Library,Documentation and Information Science Division

“A research journal serves that narrow

borderland which separates the known from the unknown”

-P.C.Mahalanobis


Probability on trees and networks /



xv, 699 pages, 8 unnumbered pages of plates : illustrations (some color) ; 27 cm. - (Cambridge series in statistical and probabilistic mathematics ) Content notes : 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. Trees (Graph theory)

Library, Documentation and Information Science Division, Indian Statistical Institute, 203 B T Road, Kolkata 700108, INDIA
Phone no. 91-33-2575 2100, Fax no. 91-33-2578 1412, ksatpathy@isical.ac.in