Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 17 Nov 2015 in math.PR | (1511.05361v1)

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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.