This note demonstrates an efficient method to find stationary probabilities in QBD processes, suggesting improvements in algorithm design.
We consider a class of Markov chains, called quasi-birth-and-death (QBD) processes, for which the stationary probability distribution, when it exists, is of the matrix-geometric form. An essential step in most algorithms for computing such a distribution is the evaluation of a rate matrix R which is a solution of a matrix quadratic equation. In this paper, we show how the eigenvalues of R can be determined explicitly when the infinitesimal generator of the QBD process has a special structure. Under certain conditions, the stationary probability vector is obtained in terms of the unique eigenvalue without computing R.
No takes yet. Share an insight, caveat, or question.
Hsing Luh (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: