Infinite block-structured transition matrices and their properties (1998) [1 citations — 1 self]
|
Abstract:
In this paper, we study Markov chains with infinite state block-structured transition matrices, whose states are partitioned into levels according to the block structure, and various associated measures. Roughly speaking, these measures involve first passage times or expected numbers of visits to certain levels without hitting other levels; they are very important and often play a key role in the study of a Markov chain. Necessary and/or sufficient conditions are obtained for a Markov chain to be positive recurrent, recurrent, or transient in terms of these measures. Results are obtained for general irreducible Markov chains as well as those with transition matrices possessing some block structure. We also discuss the decomposition or the factorization of the characteristic equations of these measures. In the scalar case, we locate the zeros of these characteristic functions and therefore use these zeros to characterize a Markov chain. Examples and various remarks are given to illustrate some of the results.
Citations
| 390 | Matrix Geometric Solutions in Stochastic Models: An Algorithmic Approach – Neuts - 1981 |
| 335 | Applied Probability and Queues – Asmussen - 1987 |
| 186 | Structured Stochastic Matrices of M/G/1 Type and Their Applications – Neuts - 1989 |
| 143 | A Second Course – Karlin, Taylor - 1981 |
| 11 | Equilibrium distribution of blockstructured Markov chains with repeating rows – Grassmann, Heyman - 1990 |
| 8 | Computation of steady-state probabilities for infinite-state Markov chains with repeating rows – Grassmann, Heyman - 1993 |
| 7 | Two queues in parallel – Haight - 1958 |
| 5 | Augmented truncations of infinite stochastic matrices – Gibson, Seneta - 1987 |
| 4 | Approximating Countable Markov Chains, 2nd edn – Freedman - 1983 |
| 4 | Denumerable Markov Chains, 2nd edn – Kemeny, Snell, et al. - 1976 |
