Approximating Countable Markov Chains

Front Cover
Holden-Day, 1971 - Markov processes - 140 pages
The book, part of a trilogy covering the field of Markov processes, explains one method of approximating countable Markov chains by finite ones. Intended for use in seminars with advanced graduate students, it is written in the framework of the first book in the trilogy, Markov Chains, although it is completely independent of the second, Brownian Motion and Diffusion. The idea is to skip over the times at which the chain is outside some large, finite set of states. The technique is especially useful for dealing with instantaneous states. Many of the results are original. (Author).

From inside the book

Contents

RESTRICTING THE RANGE
1
INTRODUCTION TO DISCRETE TIME
4
RESTRICTING THE RANGE APPLICATIONS
64
Copyright

47 other sections not shown

Other editions - View all

Common terms and phrases

Bibliographic information