Discrete Probability Models and Methods: Probability on Graphs and Trees, Markov Chains and Random Fields, Entropy and Coding

Pierre Bremaud 1, 2
1 DYOGENE - Dynamics of Geometric Networks
DI-ENS - Département d'informatique de l'École normale supérieure, CNRS - Centre National de la Recherche Scientifique : UMR 8548, Inria de Paris
Abstract : 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.
Complete list of metadatas

https://hal.inria.fr/hal-01505040
Contributor : Bartlomiej Blaszczyszyn <>
Submitted on : Monday, April 10, 2017 - 8:29:24 PM
Last modification on : Monday, January 28, 2019 - 9:04:20 AM

Identifiers

Collections

Citation

Pierre Bremaud. Discrete Probability Models and Methods: Probability on Graphs and Trees, Markov Chains and Random Fields, Entropy and Coding. Springer, 78, pp.559, 2017, Springer Probability Theory and Stochastic Modelling, ⟨10.1007/978-3-319-43476-6⟩. ⟨hal-01505040⟩

Share

Metrics

Record views

345