Open Access
July, 1991 The Ruin Problem for Finite Markov Chains
Thomas Hoglund
Ann. Probab. 19(3): 1298-1310 (July, 1991). DOI: 10.1214/aop/1176990345

Abstract

We derive an asymptotic approximation of the joint distribution $\operatorname{prob}(N(u) - n \in A, S_{N(u)} - u \in B)$ as $n$ and $u \rightarrow \infty$. Here $N(u) = \min\{n; S_n > u\}$ denotes the first passage time for a random walk of the form $S_n = \sum^n_{k = 1}U_k(\xi_{k - 1},\xi_k)$, where $\xi_0,\xi_1,\ldots$ is a finite Markov chain and where $\{U_k(i,j)\}^\infty_{k = 1}$ is a sequence of independent random variables. The approximation holds for all sets $B$ and a fairly large class of sets $A$.

Citation

Download Citation

Thomas Hoglund. "The Ruin Problem for Finite Markov Chains." Ann. Probab. 19 (3) 1298 - 1310, July, 1991. https://doi.org/10.1214/aop/1176990345

Information

Published: July, 1991
First available in Project Euclid: 19 April 2007

zbMATH: 0744.60083
MathSciNet: MR1112417
Digital Object Identifier: 10.1214/aop/1176990345

Subjects:
Primary: 60J10
Secondary: 60J15

Keywords: Boundary crossing , large deviations , Markov chains

Rights: Copyright © 1991 Institute of Mathematical Statistics

Vol.19 • No. 3 • July, 1991
Back to Top