Markov Chains

This 2 nd edition is a thoroughly revised and augmented version of the book with the same title published in 1999. The author begins with the elementary theory of Markov chains and very progressively brings the reader to more advanced topics. He gives a useful review of probability, making 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 is slowly and carefully developed, in order to make self-study easier. The book treats the classical topics of Markov chain theory, both in discrete time and continuous time, as well as connected topics such as finite Gibbs fields, nonhomogeneous Markov chains, discrete-time regenerative processes, Monte Carlo simulation, simulated annealing, and queuing theory.

The main additions of the 2 nd edition are the exact sampling algorithm of Propp and Wilson, the electrical network analogy of symmetric random walks on graphs, mixing times and additional details on the branching process. The structure of the book has been modified in order to smoothly incorporate this new material. Among the features that should improve reader-friendliness, the three main ones are: a shared numbering system for the definitions, theorems and examples; the attribution of titles to the examples and exercises; and the blue highlighting of important terms. 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.

Thoroughly revises and updates the 1st edition, making it a completely self-contained textbook on Markov chains and stochastic processes Includes material for basic and advanced courses on Markov Chains, with complementary material on continuous-time Markov chains and Markovian queueing theory Improves reader-friendliness by including: a shared numbering system for the definitions, theorems and examples; titles for the examples and exercises; blue highlighting of important terms

Auteur

Pierre Brémaud graduated from the École Polytechnique and obtained his Doctorate in Mathematics from the University of Paris VI and his PhD from the department of Electrical Engineering and Computer Science at the University of California, Berkeley. He is a major contributor to the theory of stochastic processes and their applications, and has authored or co-authored several reference books and textbooks.

Contenu

Preface.- 1 Probability Review.- 2 Discrete-Time Markov Chains.- 3 Recurrence and Ergodicity.- 4 Long-Run Behavior.- 5 Discrete-Time Renewal Theory.- 6 Absorption and Passage Times.- 7 Lyapunov Functions and Martingales.- 8 Random Walks on Graphs.- 9 Convergence Rates.- 10 Markov Fields on Graphs.- 11 Monte Carlo Markov Chains.- 12 Non-homogeneous Markov Chains.- 13 Continuous-Time Markov Chains.- 14 Markovian Queueing Theory.- Appendices.- Bibliography.- Index.