Hostname: page-component-7b7567c8c-lpg2g Total loading time: 0 Render date: 2026-11-15T22:58:16.932Z Has data issue: false hasContentIssue false

Markov Chains Conditioned Never to Wait Too Long at the Origin

Published online by Cambridge University Press:  14 July 2016

Saul Jacka*
Affiliation:
University of Warwick
*
∗ Postal address: Department of Statistics, University of Warwick, Coventry CV4 7AL, UK. Email address: s.d.jacka@warwick.ac.uk
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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 that there is a weak limit as T→∞ in the cases where either the state space is finite or X is transient. We give sufficient 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.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 2009