pith. sign in

arxiv: 1511.05361 · v1 · pith:ZR45A4HLnew · submitted 2015-11-17 · 🧮 math.PR

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

classification 🧮 math.PR
keywords chaininftyladderdrivingmarkovmathcalpositiverandom
0
0 comments X
read the original abstract

Let $(M_{n},S_{n})_{n\ge 0}$ be a Markov random walk with positive recurrent driving chain $(M_{n})_{n\ge 0}$ having countable state space $\mathcal{S}$ and stationary distribution $\pi$. It is shown in this note that, if the dual sequence $({}^{\#}M_{n},{}^{\#}S_{n})_{n\ge 0}$ is positive divergent, i.e. ${}^{\#}S_{n}\to\infty$ a.s., then the strictly ascending ladder epochs $\sigma_{n}^{>}$ of $(M_{n},S_{n})_{n\ge 0}$ are a.s. finite and the ladder chain $(M_{\sigma_{n}^{>}})_{n\ge 0}$ is positive recurrent on some $\mathcal{S}^{>}\subset\mathcal{S}$. We also provide simple expressions for its stationary distribution $\pi^{>}$, an extension of the result to the case when $(M_{n})_{n\ge 0}$ is null recurrent, and a counterexample that demonstrates that ${}^{\#}S_{n}\to\infty$ a.s. does not necessarily entail $S_{n}\to\infty$ a.s., but rather $\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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.