1 option
Discrete Probability Models and Methods : Probability on Graphs and Trees, Markov Chains and Random Fields, Entropy and Coding / by Pierre Brémaud.
Springer Nature - Springer Mathematics and Statistics eBooks 2017 English International Available online
View online- Format:
- Book
- Author/Creator:
- Brémaud, Pierre., Author.
- Series:
- Probability Theory and Stochastic Modelling, 2199-3149 ; 78
- Language:
- English
- Subjects (All):
- Probabilities.
- Computer science--Mathematics.
- Computer science.
- Mathematical statistics.
- Graph theory.
- Coding theory.
- Information theory.
- Computer networks.
- Probability Theory.
- Probability and Statistics in Computer Science.
- Graph Theory.
- Coding and Information Theory.
- Computer Communication Networks.
- Local Subjects:
- Probability Theory.
- Probability and Statistics in Computer Science.
- Graph Theory.
- Coding and Information Theory.
- Computer Communication Networks.
- Physical Description:
- 1 online resource (XIV, 559 p. 92 illus.)
- Edition:
- 1st ed. 2017.
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2017.
- Summary:
- 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. .
- Contents:
- Introduction
- 1.Events and probability
- 2.Random variables
- 3.Bounds and inequalities
- 4.Almost-sure convergence
- 5.Coupling and the variation distance
- 6.The probabilistic method
- 7.Codes and trees
- 8.Markov chains
- 9.Branching trees
- 10.Markov fields on graphs
- 11.Random graphs
- 12.Recurrence of Markov chains
- 13.Random walks on graphs
- 14.Asymptotic behaviour of Markov chains
- 15.Monte Carlo sampling
- 16. Convergence rates
- Appendix
- Bibliography.
- Notes:
- Includes bibliographical references and index.
- ISBN:
- 3-319-43476-4
- OCLC:
- 972330747
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.