Couplings of markov chains by randomized stopping times |
| |
Authors: | Andreas Greven |
| |
Affiliation: | (1) Institut für Angewandte Mathematik, Universität Heidelberg, Im Neuenheimer Feld 294, D-6900 Heidelberg 1, Germany |
| |
Abstract: | Summary We consider a Markov chain on (E, ) generated by a Markov kernel P. We study the question, when we can find for two initial distributions and two randomized stopping times T of (Xn)nNand S of (Xn)nN, such that the distribution of XTequals the one of XSand T, S are both finite.The answer is given in terms of -, h with h bounded harmonic, or in terms of .For stopping times T, S for two chains (Xn)nN,(Xn)nNwe consider measures , on (E, ) defined as follows: (A)=expected number of visits of (Xn) toA before T, (A)=expected number of visits of (Xn) toA before S.We show that we can construct T, S such that and are mutually singular and (vXT)=(XS. We relate and to the positive and negative part of certain solutions of the Poisson equation (I-P)(·)=-. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|