Hostname: page-component-848d4c4894-nr4z6 Total loading time: 0 Render date: 2024-06-08T19:28:33.997Z Has data issue: false hasContentIssue false

The spectral gap and perturbation bounds for reversible continuous-time Markov chains

Published online by Cambridge University Press:  14 July 2016

A. Yu. Mitrophanov*
Affiliation:
Saratov State University

Abstract

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.

Type
Short Communications
Copyright
Copyright © Applied Probability Trust 2004 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Aldous, D. J., and Fill, J. A. (2004). Reversible Markov Chains and Random Walks on Graphs. In preparation. Drafts of chapters available at http://www.stat.berkeley.edu/users/aldous/.Google Scholar
Cho, G. E., and Meyer, C. D. (2001). Comparison of perturbation bounds for the stationary distribution of a Markov chain. Linear Algebra Appl. 335, 137150.Google Scholar
Meyer, C. D. (1994). Sensitivity of the stationary distribution of a Markov chain. SIAM J. Matrix Anal. Appl. 15, 715728.Google Scholar
Mitrophanov, A. Yu. (2003). Stability and exponential convergence of continuous-time Markov chains. J. Appl. Prob. 40, 970979.Google Scholar
Pritchard, G., and Scott, D. J. (2001). Empirical convergence rates for continuous-time Markov chains. J. Appl. Prob. 38, 262269.Google Scholar
Seneta, E. (1993). Sensitivity of finite Markov chains under perturbation. Statist. Prob. Lett. 17, 163168.Google Scholar