Discrete Probability Models and Methods: Probability on Graphs and Trees, Markov Chains and Random Fields, Entropy and Coding - Probability Theory and Stochastic Modelling 78 (Hardback)Pierre Bremaud (author)
- We can order this
The emphasis in this book is placed on general models (Markov chains, random fields, random graphs), universal methods (the probabilistic method, the coupling method, the Stein-Chen method, martingale methods, the method of types) and versatile tools (Chernoff's bound, Hoeffding's inequality, Holley's inequality) whose domain of application extends far beyond the present text. Although the examples treated in the book relate to the possible applications, in the communication and computing sciences, in operations research and in physics, this book is in the first instance concerned with theory.
The level of the book is that of a beginning graduate course. It is self-contained, the prerequisites consisting merely of basic calculus (series) and basic linear algebra (matrices). The reader is not assumed to be trained in probability since the first chapters give in considerable detail the background necessary to understand the rest of the book.
Publisher: Springer International Publishing AG
Number of pages: 559
Weight: 1284 g
Dimensions: 235 x 155 x 35 mm
Edition: 1st ed. 2017
"This is a book that any discrete proababilist will want to have on the shelf. It is a comprehensive extension of the author's masterfully written text Markov Chains ... Surprisingly; the book contains an extensive amount of information theory. ... In my opinion the new book would be ideal for a year-long course on discrete probability." (Yevgeniy Kovchegov, Mathematical Reviews, May, 2018)
"This is a very carefully and well-written book. The real pleasure comes from the contents but also from the excellent fonts and layout. Graduate university students and their teachers can benefit a lot of reading and using this book. There are more than good reasons to strongly recommend the book to anybody studying, teaching and/or researching in probability and its applications." (Jordan M. Stoyanov, zbMATH 1386.60003, 2018)
"This is a comprehensive volume on the application of discrete probability to combinatorics, information theory, and related fields. It is accessible for first-year graduate students. ... Results are easy to find and reasonably easy to understand. ... Summing Up: Recommended. Graduate students and faculty." (M. Bona, Choice, Vol. 54 (12), August, 2017)
You may also be interested in...
Please sign in to write a review