×

Strong stationary duality for continuous-time Markov chains. I: Theory. (English) Zbl 0746.60075

Let \(X\equiv (X(t),\;0\leq t<\infty)\) be an ergodic continuous-time Markov chain with finite or countably infinite state space \(S\), distribution \(\pi_ t\) at time \(t\) and stationary distribution \(\pi\). The variation distance is defined as \(\| \pi_ t - \pi\|=\sup_{A\subset S}|\pi_ t(A) - \pi(A)|\), and a strong stationary time \(T\) is a randomized stopping time for \(X\) such that, conditionally on \((T<\infty)\), \(X(T)\) has distribution \(\pi\) and is independent of \(T\). The author shows that strong stationary times lead to bounds on variation distance, and that they can be built by constructing and analyzing a strong stationary dual Markov chain. A particularly simple construction is given for the special class of monotone likelihood chains, which incorporates birth-death processes.

MSC:

60J27 Continuous-time Markov processes on discrete state spaces
Full Text: DOI

References:

[1] Diaconis, P. (1988).Group Representations in Probability and Statistics. Institute of Mathematical Statistics, Hayward, CA. · Zbl 0695.60012
[2] Diaconis, P., and Fill, J. A. (1990a). Strong stationary times via a new form of duality.Ann. Prob. 18, 1483-1522. · Zbl 0723.60083 · doi:10.1214/aop/1176990628
[3] Diaconis, P., and Fill, J. A. (1990b). Examples for the theory of strong stationary duality with countable state spaces.Prob. Eng. Inform. Sci. 4, 157-180. · Zbl 1134.60358 · doi:10.1017/S0269964800001522
[4] Diaconis, P., and Stroock, D. (1991). Geometric bounds for eigenvalues of Markov chains.Ann. Appl. Prob. 1, 36-61. · Zbl 0731.60061 · doi:10.1214/aoap/1177005980
[5] Fill, J. A. (1991a). Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process.Ann. Appl. Prob. 1, 62-87. · Zbl 0726.60069 · doi:10.1214/aoap/1177005981
[6] Fill, J. A. (1991b). Time to stationarity for a continuous-time Markov chain.Prob. Eng. Info. Sci. 5, 45-70. · Zbl 1134.60363
[7] Horn, R. A., and Johnson, C. R. (1990).Topics in Matrix Analysis. Cambridge University Press, Cambridge, England. · Zbl 0729.15001
[8] Reuter, G. E. H. (1957). Denumerable Markov processes and the associated contraction semigroups onl.Acta Math. 97, 1-46. · Zbl 0079.34703 · doi:10.1007/BF02392391
[9] Siegmund, D. (1976). The equivalence of absorbing and reflecting barrier problems for stochastically monotone Markov processes.Ann. Prob. 4, 914-924. · Zbl 0364.60109 · doi:10.1214/aop/1176995936
[10] Van Doorn, E. A. (1980). Stochastic monotonicity of birth-death processes.Adv. Appl. Prob. 12, 59-80. · Zbl 0421.60075 · doi:10.2307/1426494
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.