Markov Chains

For students in pure and applied probability; lots of applications, fairly self-contained.

Markov chains are central to the understanding of random processes. This is not only because they pervade the applications of random processes, but also because one can calculate explicitly many quantities of interest. This textbook, aimed at advanced undergraduate or MSc students with some background in basic probability theory, focuses on Markov chains and quickly develops a coherent and rigorous theory whilst showing also how actually to apply it. Both discrete-time and continuous-time chains are studied. A distinguishing feature is an introduction to more advanced topics such as martingales and potentials in the established context of Markov chains. There are applications to simulation, economics, optimal control, genetics, queues and many other topics, and exercises and examples drawn both from theory and practice. It will therefore be an ideal text either for elementary courses on random processes or those that are more oriented towards applications.

Introduction; 1. Discrete-time Markov chains; 2. Continuous-time Markov chains I; 3. Continuous-time Markov chains II; 4. Further theory; 5. Applications; Appendix; Probability and measure; Index.

A textbook for students with some background in probability that develops quickly a rigorous theory of Markov chains and shows how actually to apply it, e.g. to simulation, economics, optimal control, genetics, queues and many other topics, and exercises and examples drawn both from theory and practice.