000			02032nam 2200337| 4500
001			85124
005			20211110123207.0
010			_a978-3-319-43476-6 _dcompra
090			_a85124
100			_a20190128d2017 k||y0pory50 ba
101	0		_aeng
102			_aUS
200	1		_aDiscrete probability models and methods _bDocumento electrónico _fPierre Brémaud _eprobability on graphs and trees, markov chains and random fields, entropy and coding
210			_aCham _cSpringer International Publishing _d2017
215			_aXIV, 559 p. 92 il.
225	2		_aProbability theory and stochastic modelling
300			_aColocação: Online
303			_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. .
410	1		_x2199-3130 _v78
606			_aDistribuição (Teoria das probabilidades)
606			_aInformática
606			_aTeoria de codificação
606			_aRede de computadores networks
680			_aQA273
700			_aBrémaud _bPierre
801		0	_gRPC _aPT
856			_uhttps://doi.org/10.1007/978-3-319-43476-6
942			_2lcc _cF _n0