Answers are grounded in this paper and cite their sources.
It is shown that a class of infinite, block-partitioned, stochastic matrices has a matrix-geometric invariant probability vector of the form ( x 0 , x 1 ,…), where x k = x 0 R k , for k ≧ 0. The rate matrix R is an irreducible, non-negative matrix of spectral radius less than one. The matrix R is the minimal solution, in the set of non-negative matrices of spectral radius at most one, of a non-linear matrix equation. Applications to queueing theory are discussed. Detailed explicit and computationally tractable solutions for the GI/PH /1 and the SM/M /1 queue are obtained.
No takes yet. Share an insight, caveat, or question.
Marcel F. Neuts (1978) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: