Ladder epochs and ladder chain of a Markov random walk with discrete driving chain
Abstract
Let (Mn,Sn)n 0 be a Markov random walk with positive recurrent driving chain (Mn)n 0 having countable state space S and stationary distribution π. It is shown in this note that, if the dual sequence (\#Mn,\#Sn)n 0 is positive divergent, i.e. \#Sn∞ a.s., then the strictly ascending ladder epochs σn> of (Mn,Sn)n 0 are a.s. finite and the ladder chain (Mσn>)n 0 is positive recurrent on some S>⊂S. We also provide simple expressions for its stationary distribution π>, an extension of the result to the case when (Mn)n 0 is null recurrent, and a counterexample that demonstrates that \#Sn∞ a.s. does not necessarily entail Sn∞ a.s., but rather n∞Sn=∞ 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.