Calculation of Higher Transitions in a Markov Process
Abstract
The standard matrix method for calculating higher transition probabilities in a Markov process is briefly reviewed in the introduction. This method is extended to path multiplicities. Then a new matrix method for calculating both first arrival probabilities and multiplicities of first arrival paths is presented. The matrix method is also suitable for enumerating paths and for obtaining the diameter of a graph. An example illustrates these methods.

