Markov Chains: Gibbs Fields, Monte Carlo Simulation, and QueuesSpringer Science & Business Media, 09.03.2013 - 444 Seiten In this book, the author begins with the elementary theory of Markov chains and very progressively brings the reader to the more advanced topics. He gives a useful review of probability that makes the book self-contained, and provides an appendix with detailed proofs of all the prerequisites from calculus, algebra, and number theory. A number of carefully chosen problems of varying difficulty are proposed at the close of each chapter, and the mathematics are slowly and carefully developed, in order to make self-study easier. The author treats the classic topics of Markov chain theory, both in discrete time and continuous time, as well as the connected topics such as finite Gibbs fields, nonhomogeneous Markov chains, discrete- time regenerative processes, Monte Carlo simulation, simulated annealing, and queuing theory. The result is an up-to-date textbook on stochastic processes. Students and researchers in operations research and electrical engineering, as well as in physics and biology, will find it very accessible and relevant. |
Inhalt
| 1 | |
| 53 | |
| 65 | |
| 80 | |
| 95 | |
Long Run Behavior | 125 |
Lyapunov Functions and Martingales | 167 |
Eigenvalues and Nonhomogeneous Markov Chains | 195 |
Bayesian Restoration of Images | 275 |
ContinuousTime Markov Models | 323 |
Poisson Calculus and Queues | 369 |
Appendix | 417 |
Bibliography | 433 |
Subject Index | 441 |
215 | 442 |
Gibbs Fields and Monte Carlo Simulation | 253 |
Andere Ausgaben - Alle anzeigen
Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues Pierre Bremaud Eingeschränkte Leseprobe - 2001 |
Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues Pierre Bremaud Keine Leseprobe verfügbar - 2013 |
Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues Pierre Bremaud Keine Leseprobe verfügbar - 2010 |
Häufige Begriffe und Wortgruppen
algorithm bounded called Chapter clique compute configuration continuous-time HMC corresponding countable defined Definition denoted discrete-time eigenvalue equality ergodic event Example exists exponential finite state space follows formula function Gibbs sampler given HPPs independent infinite infinitesimal initial distribution integer invariant measure irreducible Ising model Jackson network limn Markov chain Markov property martingale nonnegative notation number of customers obtain parameters particular phase Pij(t point process Poisson process Poisson system positive recurrent probability distribution Problem Proof queue random field random variables real numbers regular jump HMC resp respect result S₁ satisfied semigroup sequence server Show simulated annealing simulation solution stationary distribution stochastic matrix stochastic process strong Markov property Suppose t₁ Theorem 2.1 theory transient transition matrix transition semigroup u₁ v₁ values vector X₁ Xn+1 λί
