Discrete Probability Models and Methods - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Ouvrage (Y Compris Édition Critique Et Traduction) Année : 2017

Discrete Probability Models and Methods

Résumé

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.
Fichier non déposé

Dates et versions

hal-01505040 , version 1 (10-04-2017)

Identifiants

Citer

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⟩
412 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More