Applications of generalized inverses to Markov chains

First it is shown that any generalized inverse of the infinitesimal generator of an irreducible Markov chain can be used to compute the exact stationary distribution and all the expected first-passage times of the chain. In the special case of a single-server queue this allows all computations to be done with upper-triangular matrices. Next it is shown that the effect of a perturbation of the infinitesimal generator on the stationary distribution and expected first-passage times can also be computed using generalized inverses. These results extend and generalize Schweitzer's [9] original work using fundamental matrices. It is then shown that any perturbation can be broken up into a series of perturbations each involving a single state.