The computation of the mean first passage times for Markov chains

A survey of a variety of computational procedures for finding the mean first passage times in Markov chains is presented. The author recently developed a new accurate computational technique, an Extended GTH Procedure, Hunter (2016) [17] similar to that developed by Kohlas (1986) [20]. In addition, the author recently developed a variety of new perturbation techniques for finding key properties of Markov chains including finding the mean first passage times, Hunter (2016) [18]. These recently developed procedures are compared with other procedures including the standard matrix inversion technique using the fundamental matrix Kemeny and Snell (1960) [19], some simple generalized matrix inverse techniques developed by Hunter (2007) [15], and some modifications to the FUND technique of Heyman (1995) [7]. MATLAB is used to compute errors and estimate computation times when the techniques are used on some test problems that have been used in the literature together with some large sparse state-space cases. For accuracy a preference for the procedure of the author is exhibited for the test problems. However it appears that the procedure, as presented, requires longer computational times.