Markov chains conditioned never to wait too long at the origin
Date: April 2009
Abstract: Abstract. Motivated by Feller's coin-tossing problem, we consider the problem of conditioning an irreducible Markov chain never to wait too long at 0. Denoting by the first time that the chain, X, waits for at least one unit of time at the origin, we consider conditioning the chain on the event (_ > T). We show there is a weak limit as T ! 1 in the cases where either the statespace is _nite or X is transient. We give su_cient conditions for the existence of a weak limit in other cases and show that we have vague convergence to a defective limit if the time to hit zero has a lighter tail than and is subexponential.