The Resource Discrete Probability Models and Methods : Probability on Graphs and Trees, Markov Chains and Random Fields, Entropy and Coding, by Pierre Brémaud, (electronic resource)
Discrete Probability Models and Methods : Probability on Graphs and Trees, Markov Chains and Random Fields, Entropy and Coding, by Pierre Brémaud, (electronic resource)
Resource Information
The item Discrete Probability Models and Methods : Probability on Graphs and Trees, Markov Chains and Random Fields, Entropy and Coding, by Pierre Brémaud, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in European University Institute.This item is available to borrow from 1 library branch.
Resource Information
The item Discrete Probability Models and Methods : Probability on Graphs and Trees, Markov Chains and Random Fields, Entropy and Coding, by Pierre Brémaud, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in European University Institute.
This item is available to borrow from 1 library branch.
- 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.--
- Language
- eng
- Extent
- 1 online resource (XIV, 559 pages)
- 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
- Isbn
- 9783319434766
- Label
- Discrete Probability Models and Methods : Probability on Graphs and Trees, Markov Chains and Random Fields, Entropy and Coding
- Title
- Discrete Probability Models and Methods
- Title remainder
- Probability on Graphs and Trees, Markov Chains and Random Fields, Entropy and Coding
- Statement of responsibility
- by Pierre Brémaud
- Language
- eng
- 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.--
- Assigning source
- Provided by publisher
- http://library.link/vocab/creatorName
- Brémaud, Pierre
- Image bit depth
- 0
- Literary form
- non fiction
- Nature of contents
- dictionaries
- Series statement
-
- Springer eBooks
- Probability Theory and Stochastic Modelling,
- Series volume
- 78
- http://library.link/vocab/subjectName
-
- Mathematics
- Computer communication systems
- Coding theory
- Mathematical statistics
- Probabilities
- Graph theory
- Mathematics
- Probability Theory and Stochastic Processes
- Probability and Statistics in Computer Science
- Graph Theory
- Coding and Information Theory
- Computer Communication Networks
- Label
- Discrete Probability Models and Methods : Probability on Graphs and Trees, Markov Chains and Random Fields, Entropy and Coding, by Pierre Brémaud, (electronic resource)
- Antecedent source
- mixed
- Carrier category
- online resource
- Carrier category code
-
- cr
- Carrier MARC source
- rdacarrier
- Color
- not applicable
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent
- 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
- Control code
- 978-3-319-43476-6
- Dimensions
- unknown
- Extent
- 1 online resource (XIV, 559 pages)
- File format
- multiple file formats
- Form of item
-
- online
- electronic
- Governing access note
- Use of this electronic resource may be governed by a license agreement which restricts use to the European University Institute community. Each user is responsible for limiting use to individual, non-commercial purposes, without systematically downloading, distributing, or retaining substantial portions of information, provided that all copyright and other proprietary notices contained on the materials are retained. The use of software, including scripts, agents, or robots, is generally prohibited and may result in the loss of access to these resources for the entire European University Institute community
- Isbn
- 9783319434766
- Level of compression
- uncompressed
- Media category
- computer
- Media MARC source
- rdamedia
- Media type code
-
- c
- Other control number
- 10.1007/978-3-319-43476-6
- Other physical details
- 92 illustrations
- Quality assurance targets
- absent
- Reformatting quality
- access
- Specific material designation
- remote
- System control number
- (OCoLC)972330747
- Label
- Discrete Probability Models and Methods : Probability on Graphs and Trees, Markov Chains and Random Fields, Entropy and Coding, by Pierre Brémaud, (electronic resource)
- Antecedent source
- mixed
- Carrier category
- online resource
- Carrier category code
-
- cr
- Carrier MARC source
- rdacarrier
- Color
- not applicable
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent
- 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
- Control code
- 978-3-319-43476-6
- Dimensions
- unknown
- Extent
- 1 online resource (XIV, 559 pages)
- File format
- multiple file formats
- Form of item
-
- online
- electronic
- Governing access note
- Use of this electronic resource may be governed by a license agreement which restricts use to the European University Institute community. Each user is responsible for limiting use to individual, non-commercial purposes, without systematically downloading, distributing, or retaining substantial portions of information, provided that all copyright and other proprietary notices contained on the materials are retained. The use of software, including scripts, agents, or robots, is generally prohibited and may result in the loss of access to these resources for the entire European University Institute community
- Isbn
- 9783319434766
- Level of compression
- uncompressed
- Media category
- computer
- Media MARC source
- rdamedia
- Media type code
-
- c
- Other control number
- 10.1007/978-3-319-43476-6
- Other physical details
- 92 illustrations
- Quality assurance targets
- absent
- Reformatting quality
- access
- Specific material designation
- remote
- System control number
- (OCoLC)972330747
Subject
- Coding theory
- Computer Communication Networks
- Computer communication systems
- Graph Theory
- Graph theory
- Mathematical statistics
- Mathematics
- Probabilities
- Probability Theory and Stochastic Processes
- Probability and Statistics in Computer Science
- Coding and Information Theory
Member of
- Probability Theory and Stochastic Modelling,, 78
- Springer eBooks, Mathematics and Statistics Collection
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.library.eui.eu/portal/Discrete-Probability-Models-and-Methods-/1ZJHUp50E_I/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.eui.eu/portal/Discrete-Probability-Models-and-Methods-/1ZJHUp50E_I/">Discrete Probability Models and Methods : Probability on Graphs and Trees, Markov Chains and Random Fields, Entropy and Coding, by Pierre Brémaud, (electronic resource)</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.eui.eu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.eui.eu/">European University Institute</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data - Experimental
Data Citation of the Item Discrete Probability Models and Methods : Probability on Graphs and Trees, Markov Chains and Random Fields, Entropy and Coding, by Pierre Brémaud, (electronic resource)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.library.eui.eu/portal/Discrete-Probability-Models-and-Methods-/1ZJHUp50E_I/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.eui.eu/portal/Discrete-Probability-Models-and-Methods-/1ZJHUp50E_I/">Discrete Probability Models and Methods : Probability on Graphs and Trees, Markov Chains and Random Fields, Entropy and Coding, by Pierre Brémaud, (electronic resource)</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.eui.eu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.eui.eu/">European University Institute</a></span></span></span></span></div>