Discrete probability models and methods. Probability on graphs and trees, Markov chains and random fields, entropy and coding

DOI10.1007/978-3-319-43476-6MaRDI QIDQ2829285zbMATH OpenOpenAlexFDO

Authors Pierre Brémaud

Publication date 27 October 2016

Published in Probability Theory and Stochastic Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-43476-6

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Random graphs (graph-theoretic aspects) (05C80) Random matrices (probabilistic aspects) (60B20) Research exposition (monographs, survey articles) pertaining to probability theory (60-02) Combinatorial probability (60C05) Random walks on graphs (05C81)

Recommendations

• Discrete stochastic processes and applications
• Probability and Computing
• A first course in probability and Markov chains
• Probability on trees and networks
• Markov chains. Gibbs fields, Monte Carlo simulation and queues

Cited in

(15)

• The degree-wise effect of a second step for a random walk on a graph
• What matters in school choice tie-breaking? How competition guides design
• Almost sure convergence for the maxima and minima of strongly dependent nonstationary multivariate Gaussian sequences
• Bias of particle approximations to optimal filter derivative
• Stationary distribution of telomere lengths in cells with telomere length maintenance and its parametric inference
• The linear conditional expectation in Hilbert space
• Modern Discrete Probability
• Learning system parameters from Turing patterns
• Probability on graphs. Random processes on graphs and lattices.
• Expectation analysis for bounding solutions of the 0-1 knapsack problem
• Towards quantum gravity with neural networks: solving the quantum Hamilton constraint of U(1) BF theory
• Limit behaviour of random walks on ℤ^mwith two-sided membrane
• scientific article; zbMATH DE number 52270 (Why is no real title available?)
• Robust and accurate stopping criteria for adaptive randomized sampling in matrix-free hierarchically semiseparable construction
• Probability on trees and networks

This page was built for publication: Discrete probability models and methods. Probability on graphs and trees, Markov chains and random fields, entropy and coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829285)