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

Name: Discrete Probability Models and Methods: Probability on Graphs and Trees, Markov Chains and Random Fields, Entropy and Coding
Rating: 1 (1 reviews)

Pierre Brémaud

2017년 1월 · Springer

리뷰 1개

eBook

559

페이지

eBook 정보

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.

콘텐츠 둘러보기

평점 및 리뷰

리뷰 1개

저자 정보

Pierre Brémaud obtained his Doctorate in Mathematics from the University of Paris VI and his PhD from the department of Electrical Engineering and Computer Science of the University of California at Berkeley. He is a major contributor to the theory of stochastic processes and their applications, and has authored or co-authored several reference or textbooks on the subject.