Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Discrete probability models and methods : probability on graphs and trees, Markov chains and random fields, entropy and coding
Brémaud P., Springer International Publishing, New York, NY, 2017. 559 pp. Type: Book (978-3-319434-75-9)
Date Reviewed: Feb 21 2018

Due to advances in both theory and practice, there has been a recent explosion in courses on network science and data science. These demand a solid background in probabilistic methods.

For example, Markov chains are used for node ranking in complex networks, and data compression is used for minimization of communication in wireless networks. Therefore, books such as this one, which offer the necessary solid introduction along with more advanced material on probabilistic models and methods, are necessary for these courses.

This book’s 21 chapters describe generic models such as Markov chains, Erdos-Renyi (random) graphs, random walks on graphs, and Markov fields; include universal methods such as the Stein and martingale methods; and cover many useful tools such as the Chernoff, Hoeffding, and Holley inequalities. The first five chapters present basic material to make the book as self-contained as possible, although experience in calculus and linear algebra is necessary.

This book is an excellent piece of writing. It has the strictness of a mathematical book whose traditional purpose is to state and prove theorems, and also has the features of a book on an engineering topic, where solved and unsolved exercises are provided. I appreciated the very carefully selected solved examples that are interwoven in each chapter. They provide an indispensable aid to digest the concepts and methods presented.

Primarily, the book targets an audience whose focus is on the theory of probability. Advanced undergraduate or graduate students are the book’s two main audiences. However, I firmly believe that the book is equally useful for computer scientists and engineers, communication engineers, and moreover physicists. For instance, the chapters on Markov chains are among the main reasons for the book’s relevance to many disciplines.

Other phenomena such as percolation and phase transition, encountered mainly in physics and in the study of networks, can also be explained using probability models.

Overall, the book is a valuable addition to the arsenal of students and professionals in their battle to understand and scientifically model the world.

Reviewer:  Dimitrios Katsaros Review #: CR145865 (1805-0202)
Bookmark and Share
  Reviewer Selected
Featured Reviewer
 
 
Probabilistic Computation (F.1.2 ... )
 
 
Model Development (I.6.5 )
 
 
Probability And Statistics (G.3 )
 
Would you recommend this review?
yes
no
Other reviews under "Probabilistic Computation": Date
Discrete random process stabilization
Lorenc A., Lapins J. Information and Control 58(1-3): 1-18, 1984. Type: Article
May 1 1986
Probabilistic inductive inference
Pitt L. Journal of the ACM 36(2): 383-433, 1989. Type: Article
Sep 1 1989
Explorations in quantum computing
Williams C. (ed), Clearwater S. (ed), TELOS, Santa Clara, CA, 1998. Type: Book (9780387947686)
Jun 1 1998
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy