Transient Markov arrival processes (Q1413684): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q182636 |
||
Property / author | |||
Property / author: Q475114 / rank | |||
Revision as of 12:26, 10 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Transient Markov arrival processes |
scientific article |
Statements
Transient Markov arrival processes (English)
0 references
17 November 2003
0 references
A family of transient Markov arrival processes (MAPs) is considered and its basic properties are analyzed. Transient MAP is defined on the basis of a continuous-time Markov chain \(\varphi(t) \in \{0,1,\dots,m\}\), \(t \in R^+\), described by constant transition rates \((D^*)_{i,j}\), \(i,j \in \{0,1,\dots,m\}\). The state \(\{0\}\) is absorbing, i.e. \((D^*)_{0,j}=0\), \(j \neq 0\). In any other state \(\{1,\dots,m\}\) a new event can occur with constant rates \((D^*_1)_{i,j}\) depending on the current transition \(i \to j\), events can happen even if \(\varphi(t)\) does not change (\(i\to i\)). The total number of events up to time epoch \(t\) is denoted by \(N(t)\). In absorbing state \(\{0\}\) no more events can occur, so, it is said that the catastrophe occurs when the Markov chain achieves this state. Special examples of MAPs are the Poisson process (\(m=1\)) and the Markov modulated Poisson process for which \(D_1^*\) is a diagonal matrix. Some other examples and possible applications are discussed. Let \(T_n\) denote the time epoch at which the \(n\)th event occurs. For the MAP the lifetime of the process \(L\), the time \(V\) until the catastrophe occurs and the total number of events \(K\) are defined as follows \[ L=\sup\{T_n:T_n<\infty\},\quad V=\inf\{t\geq 0:\varphi(t)=0\},\quad K=\lim_{t \to \infty} N(t). \] Distributions of \(L\), \(V\), \(K\) are derived. In addition, quasistationary MAPs are especially considered and some estimations are obtained in this case.
0 references
Markovian arrival process
0 references
Markov additive process
0 references
transient process
0 references
terminating process
0 references
quasistationary distribution
0 references