Probability on trees and networks (Q2833171)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 6653785
Language Label Description Also known as
default for all languages
No label defined
    English
    Probability on trees and networks
    scientific article; zbMATH DE number 6653785

      Statements

      0 references
      0 references
      17 November 2016
      0 references
      random walks
      0 references
      percolation
      0 references
      branching processes
      0 references
      mass-transport technique
      0 references
      isoperimetric inequalities
      0 references
      Hausdorff dimension
      0 references
      capacity
      0 references
      random walks on Galton-Watson trees
      0 references
      Probability on trees and networks (English)
      0 references
      This is a monumental book covering a lot of interesting problems in discrete probability, written by two experts in the field. Discrete probability is a fascinating area with rich connections with other areas in mathematics. The authors have done a great job of providing full proofs of all main results, hence creating a self-contained reference in this area. This has not damaged readability: the book is very well written and accessible.NEWLINENEWLINEThe covered topics include random walks and percolation, branching processes, the mass-transport technique, isoperimetric inequalities, and more advanced topics such as Hausdorff dimension, capacity, and random walks on Galton-Watson trees.NEWLINENEWLINEOne advantage of the book is that it is freely available on the authors' homepages. This book is a valuable reference for researchers in discrete probability and neighboring areas. Having more than 850 exercises, it is also an excellent introduction for anyone willing to enter this beautiful area. It can also be used as textbook for various graduate courses, by an instructor who knows the book well and can spend the time choosing appropriate sections to cover.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references