O'Cinneide presented an entrywise perturbation theorem for Markov chains. The error bound he obtained is nearly best possible. We give the best possible error bound.
A note on circular Markov chains
✍ Scribed by José Luis Palacios
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 70 KB
- Volume
- 47
- Category
- Article
- ISSN
- 0167-7152
No coin nor oath required. For personal study only.
✦ Synopsis
Using the electric network approach, we give closed-form formulas for the stationary probabilities and expected hitting times in balanced circular Markov chains. As an application, we give a closed-form formula for the duration of play in the general ruin problem, where the probabilities of winning a particular game depend on the amount of the current fortune.
📜 SIMILAR VOLUMES
A thorough theoretical explanation of the numerical behaviour of functional iteration methods for the computation of the minimal nonnegative solution G of the matrix equation X = ∞ i=0 X i A i , arising in the numerical solution of M/G/1 type Markov chains, is given in Meini (1997) [2]. In this note
A heart-beat interval, Markov chain approach to cardiac arrhythmia classification is reexamined, and an alternative problem formulation presented. The approach developed models heart-beat interval and underlying disorder as a partially observed, twodimensional Markov chain, where the scalar element
It is well known that successive overrelaxation (SOR) can be used to compute the stationary distribution of a homogeneous Markov chain. In a long paper Kontovasalis et al. (K. Kontovasalis, R.J. Plemmons, W.J. Stewart, Linear Algebra Appl. 154-156 (1991) showed together with other results that for p