Key points are not available for this paper at this time.
This paper discusses perturbation bounds for the stationary distribution of a finite indecomposable Markov chain. Existing bounds are reviewed. New bounds are presented which more completely exploit the stochastic features of the perturbation and which also are easily computable. Examples illustrate the tightness of the bounds and their application to bounding the error in the Simon–Ando aggregation technique for approximating the stationary distribution of a nearly completely decomposable Markov chain.
Haviv et al. (Sat,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: