The state reduction and related algorithms and their applications to the study of Markov chains, graph theory, and the optimal stopping problem
A beautiful survey of results on state reduction algorithm for countable Markov chains is given. Applications of the algorithm for different problems are considered. There are the calculation of invariant distribution and other characteristics of Markov chains, the optimal stopping time problem for Markov chains, estimation of perturbation bounds for Markov chains and some problems in graph theory. The author presents new results in the field and improves the proofs of some known results. Some applications are also considered.
scientific article; zbMATH DE number 1340109
scientific article