Uniform Markov Renewal Theory and Ruin Probabilities in Markov Random Walks
Cheng-Der Fuh
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.
Create a lesson
Related papers
Sublinear multi-type preferential attachment
Anna Ben-Hamou, Nicolas Broutin, Camille Cazaux
Uniform Central Limit Theorems for Degree Distributions of Sparse Graphon Models
Robert Lunde, Soumendra Lahiri
Matching Random Point Sets with Minimum Distortion
Itai Benjamini, Mark Braverman, Elad Tzalik et al.
Uniqueness and full coverage in k-neighbor graphs
David Coupier, Benoît Henry, Benedikt Jahnel et al.
Bass martingales need not stretch
Mathias Beiglböck, Manuel Hasenbichler, Gudmund Pammer
Universality of smallest singular values of random row submatrices and phase retrieval problems
Shu Wen, Christian E. Häggblom, Xiufan Yang