scholarly journals Applications of Paz's inequality to perturbation bounds for Markov chains

1998 ◽  
Vol 268 ◽  
pp. 183-196 ◽  
Author(s):  
Stephen J. Kirkland ◽  
Michael Neumann ◽  
Bryan L. Shader
2015 ◽  
Vol 36 (3) ◽  
pp. 917-941 ◽  
Author(s):  
Erik Thiede ◽  
Brian Van Koten ◽  
Jonathan Weare

Mathematics ◽  
2020 ◽  
Vol 8 (2) ◽  
pp. 253 ◽  
Author(s):  
Alexander Zeifman ◽  
Victor Korolev ◽  
Yacov Satin

This paper is largely a review. It considers two main methods used to study stability and to obtain appropriate quantitative estimates of perturbations of (inhomogeneous) Markov chains with continuous time and a finite or countable state space. An approach is described to the construction of perturbation estimates for the main five classes of such chains associated with queuing models. Several specific models are considered for which the limit characteristics and perturbation bounds for admissible “perturbed” processes are calculated.


2003 ◽  
Vol 40 (04) ◽  
pp. 970-979 ◽  
Author(s):  
A. Yu. Mitrophanov

For finite, homogeneous, continuous-time Markov chains having a unique stationary distribution, we derive perturbation bounds which demonstrate the connection between the sensitivity to perturbations and the rate of exponential convergence to stationarity. Our perturbation bounds substantially improve upon the known results. We also discuss convergence bounds for chains with diagonalizable generators and investigate the relationship between the rate of convergence and the sensitivity of the eigenvalues of the generator; special attention is given to reversible chains.


2004 ◽  
Vol 41 (4) ◽  
pp. 1219-1222 ◽  
Author(s):  
A. Yu. Mitrophanov

We show that, for reversible continuous-time Markov chains, the closeness of the nonzero eigenvalues of the generator to zero provides complete information about the sensitivity of the distribution vector to perturbations of the generator. Our results hold for both the transient and the stationary states.


2005 ◽  
Vol 42 (4) ◽  
pp. 1003-1014 ◽  
Author(s):  
A. Yu. Mitrophanov

For uniformly ergodic Markov chains, we obtain new perturbation bounds which relate the sensitivity of the chain under perturbation to its rate of convergence to stationarity. In particular, we derive sensitivity bounds in terms of the ergodicity coefficient of the iterated transition kernel, which improve upon the bounds obtained by other authors. We discuss convergence bounds that hold in the case of finite state space, and consider numerical examples to compare the accuracy of different perturbation bounds.


2005 ◽  
Vol 42 (04) ◽  
pp. 1003-1014 ◽  
Author(s):  
A. Yu. Mitrophanov

For uniformly ergodic Markov chains, we obtain new perturbation bounds which relate the sensitivity of the chain under perturbation to its rate of convergence to stationarity. In particular, we derive sensitivity bounds in terms of the ergodicity coefficient of the iterated transition kernel, which improve upon the bounds obtained by other authors. We discuss convergence bounds that hold in the case of finite state space, and consider numerical examples to compare the accuracy of different perturbation bounds.


2018 ◽  
Vol 41 (6) ◽  
pp. 863-876 ◽  
Author(s):  
Nazife Erkurşun-Özcan ◽  
Farrukh Mukhamedov

2010 ◽  
Vol 432 (7) ◽  
pp. 1627-1649 ◽  
Author(s):  
Zahir Mouhoubi ◽  
Djamil Aïssani

Sign in / Sign up

Export Citation Format

Share Document