Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Ladder epochs and ladder chain of a Markov random walk with discrete driving chain (1511.05361v1)

Published 17 Nov 2015 in math.PR

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

We haven't generated a summary for this paper yet.