๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A note on entrywise perturbation theory for Markov chains

โœ Scribed by Jungong Xue

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
172 KB
Volume
260
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

โœฆ Synopsis

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.

๐Ÿ“œ SIMILAR VOLUMES

A note on circular Markov chains
A note on circular Markov chains
โœ Josรฉ Luis Palacios ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 70 KB

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 fluctuation theory for Markov chains
A fluctuation theory for Markov chains
โœ V.G. Kulkarni; N.U. Prabhu ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 803 KB
Note on functional iteration technique f
Note on functional iteration technique for type Markov chains
โœ Noah H. Rhee ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 133 KB

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