Uniform Markov Renewal Theory and Ruin Probabilities in Markov Random Walks

Abstract

Let Xn,n≥0 be a Markov chain on a general state space X with transition probability P and stationary probability π. Suppose an additive component Sn takes values in the real line R and is adjoined to the chain such that (Xn,Sn),n≥0 is a Markov random walk. In this paper, we prove a uniform Markov renewal theorem with an estimate on the rate of convergence. This result is applied to boundary crossing problems for (Xn,Sn),n≥0. To be more precise, for given b≥0, define the stopping time τ=τ(b)=infn:Sn>b. When a drift μ of the random walk Sn is 0, we derive a one-term Edgeworth type asymptotic expansion for the first passage probabilities Pπτ<m and Pπτ<m,Sm<c, where m≤∞, c≤ b and Pπ denotes the probability under the initial distribution π. When μ≠0, Brownian approximations for the first passage probabilities with correction terms are derived.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…