000			01736 a2200241 4500
005			20171029113335.0
008			171029b xxu||||| |||| 00| 0 eng d
020			_a9783319434759
040			_cIITK
041			_aeng
082			_a519.2 _bB75d
100			_aBremaud, Pierre
245			_aDiscrete probability models and methods _bprobability on graphs and trees, Markov chains and random fields, entropy and coding _cPierre Bremaud
260			_bSpringer _c2017 _aSwitzerland
300			_axiv, 559p
440			_aProbability theory and stochastic modelling
490			_a/ edited by Soren Asmussen; v.78
505			_aThe 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.
650			_aProbabilities -- Data processing
650			_aComputer science -- Mathematics
650			_aMathematical statistics
942			_cBK
999			_c558138 _d558138