Large deviation principles in boundary problems for compound renewal processes (Q311242)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Large deviation principles in boundary problems for compound renewal processes |
scientific article |
Statements
Large deviation principles in boundary problems for compound renewal processes (English)
0 references
29 September 2016
0 references
Let \(\{(\tau_k,\zeta_k)\}\) be a sequence of independent random vectors, such that \(\{(\tau_k,\zeta_k): k \geq 2\}\) are identically distributed. Further, \(\tau_k > 0\) for \(k \geq 2\) and \(\tau_1 \geq 0\). We have the sums \[ T_n = \sum_{k=1}^n \tau_k\;,\qquad S_n = \sum_{k=1}^n \zeta_k\;. \] Define the renewal process \(\nu(t) = \max\{ k \geq 0: T_k < t\}\) and the compound renewal process \(Z(t) = \sum_{k=1}^{\nu(t)} \zeta_k = S_{\nu(t)}\). For the limit theorems we consider the normalised process \(z_T(t) = T^{-1} Z(t T)\). The main results consider the asymptotics of \[ {1 \over T} \ln P[z_T \in B] \qquad \text{ as }T \to \infty \] for sets \(B\) of functions of the form \[ B_g = \{f : \sup_{t \in [0,1]} (f(t) - g(t)) \geq 0\} \] or \[ B_{g h} = \{ f : g(t) \geq f(t) \geq h(t) \text{ for all }t \in [0,1]\}. \] In particular, it turns out that not always the shortest path is the most likely path in this model.
0 references
compound renewal process
0 references
large deviation principle
0 references
boundary problem
0 references
second deviation function
0 references
admissible nonhomogeneity
0 references
regular deviation
0 references
shortest trajectory
0 references
first boundary problem
0 references
level curves
0 references
second boundary problem
0 references