In probability theory, the matrix analytic method is a technique to compute the stationary probability distribution of a Markov chain which has a repeating structure (after some point) and a state space which grows unboundedly in no more than one dimension. Such models are often described as M/G/1 type Markov chains because they can describe transitions in an M/G/1 queue. The method is a more complicated version of the matrix geometric method and is the classical solution method for M/G/1 chains.
Method description An M/G/1-type stochastic matrix is one of the form
P = ( B 0 B 1 B 2 B 3 ⋯ A 0 A 1 A 2 A 3 ⋯ A 0 A 1 A 2 ⋯ A 0 A 1 ⋯ ⋮ ⋮ ⋮ ⋮ ⋱ ) {\displaystyle P={\begin{pmatrix}B_{0}&B_{1}&B_{2}&B_{3}&\cdots \\A_{0}&A_{1}&A_{2}&A_{3}&\cdots \\&A_{0}&A_{1}&A_{2}&\cdots \\&&A_{0}&A_{1}&\cdots \\\vdots &\vdots &\vdots &\vdots &\ddots \end{pmatrix}}}
where Bi and Ai are k × k matrices. (Note that unmarked matrix entries represent zeroes.) Such a matrix describes the embedded Markov chain in an M/G/1 queue. If P is irreducible and positive recurrent then the stationary distribution is given by the solution to the equations
P π = π and e T π = 1 {\displaystyle P\pi =\pi \quad {\text{ and }}\quad \mathbf {e} ^{\text{T}}\pi =1}
where e represents a vector of suitable dimension with all values equal to 1. Matching the structure of P, π is partitioned to π1, π2, π3, …. To compute these probabilities the column stochastic matrix G is computed such that
G = ∑ i = 0 ∞ G i A i . {\displaystyle G=\sum _{i=0}^{\infty }G^{i}A_{i}.}
G is called the auxiliary matrix. Matrices are defined
… excerpt ends here. Continue reading the full article.
