首页 | 本学科首页   官方微博 | 高级检索  
     


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, bernou) generated by a Markov kernel P. We study the question, when we can find for two initial distributions ngr and mgr two randomized stopping times T of (ngrXn)nisinNand S of (mgrXn)nisinN, such that the distribution of ngrXTequals the one of mgrXSand T, S are both finite.The answer is given in terms of langngr-mgr, hrang with h bounded harmonic, or in terms of 
$$mathop {lim }limits_{n to infty } left| {frac{1}{{n + 1}} cdot sumlimits_0^n {(v - mu )P^k } } right|$$
.For stopping times T, S for two chains (ngrXn)nisinN,(mgrXn)nisinNwe consider measures eegr, zeta on (E, bernou) defined as follows: eegr(A)=expected number of visits of (ngrXn) toA before T, zeta(A)=expected number of visits of (mgrXn) toA before S.We show that we can construct T, S such that eegr and zeta are mutually singular and Lscr(vXT)=Lscr(mgrXS. We relate eegr and zeta to the positive and negative part of certain solutions of the Poisson equation (I-P)(·)=ngr-mgr.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号