Key points are not available for this paper at this time.
For an m-state homogeneous Markov chain whose one-step transition matrix is T, the group inverse, A^#, of the matrix A = I - T is shown to play a central role. For an ergodic chain, it is demonstrated that virtually everything that one would want to know about the chain can be determined by computing A^#. Furthermore, it is shown that the introduction of A^# into the theory of ergodic chains provides not only a theoretical advantage, but it also provides a definite computational advantage that is not realized in the traditional framework of the theory.
Carl D. Meyer (Tue,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: