Ladder epochs and ladder chain of a Markov random walk with discrete driving chain

preprint2015arXivOpen access

Abstract

Let (Mn,Sn)n≥0(M_{n},S_{n})_{n\ge 0} be a Markov random walk with positive recurrent driving chain (Mn)n≥0(M_{n})_{n\ge 0} having countable state space S\mathcal{S} and stationary distribution ππ. It is shown in this note that, if the dual sequence (#Mn,#Sn)n≥0({}^{\#}M_{n},{}^{\#}S_{n})_{n\ge 0} is positive divergent, i.e. #Sn→∞{}^{\#}S_{n}\to\infty a.s., then the strictly ascending ladder epochs σn>σ_{n}^{>} of (Mn,Sn)n≥0(M_{n},S_{n})_{n\ge 0} are a.s. finite and the ladder chain (Mσn>)n≥0(M_{σ_{n}^{>}})_{n\ge 0} is positive recurrent on some S>⊂S\mathcal{S}^{>}\subset\mathcal{S}. We also provide simple expressions for its stationary distribution π>π^{>}, an extension of the result to the case when (Mn)n≥0(M_{n})_{n\ge 0} is null recurrent, and a counterexample that demonstrates that #Sn→∞{}^{\#}S_{n}\to\infty a.s. does not necessarily entail Sn→∞S_{n}\to\infty a.s., but rather lim sup⁡n→∞Sn=∞\limsup_{n\to\infty}S_{n}=\infty a.s. only. Our arguments are based on Palm duality theory, coupling and the Wiener-Hopf factorization for Markov random walks with discrete driving chain.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.