On strong stationary times and approximation of Markov chain hitting times by geometric sums (Q2322604)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On strong stationary times and approximation of Markov chain hitting times by geometric sums |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On strong stationary times and approximation of Markov chain hitting times by geometric sums |
scientific article |
Statements
On strong stationary times and approximation of Markov chain hitting times by geometric sums (English)
0 references
5 September 2019
0 references
The paper considers an irreducible, ergodic, discrete time Markov chain with finite state space initialized in stationary regime. It continues the investigation of the first time entrance of a given state. Under certain conditions, this time admits a representation in the form of a geometric sum of independent and identically distributed random variables. The main goal in this note is to consider the approximation of such time by a geometric sum.
0 references
Markov chains
0 references
passage time
0 references
geometric sum
0 references
strong stationary time
0 references
stochastic ordering
0 references
0 references
0 references
0.7715815305709839
0 references
0.7695198059082031
0 references
0.7620849013328552
0 references
0.7615149021148682
0 references
0.7606617212295532
0 references
