The Computation of the Mean First Passage Times for Markov Chains
arXiv:1701.07781 · doi:10.1016/j.laa.2018.03.010
Abstract
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 (Special Matrices, 2016) similar to that developed by Kohlas (Zeit. fur Oper. Res., 1986). 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 (Linear Algebra and its Applications, 2016). These recently developed procedures are compared with other procedures including the standard matrix inversion technique using the fundamental matrix (Kemeny and Snell, 1960), some simple generalized matrix inverse techniques developed by Hunter (Asia Pacific J. Oper. Res., 2007), and some modifications to the FUND technique of Heyman (SIAM J Matrix Anal. and Appl., 1995). 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.
arXiv comment43 pages, 12 tables, 8 charts, MATLAB code for computing computation errors
References in corpus (2)
Cited by in corpus (7)
- Performance of machine-learning-assisted Monte Carlo in sampling from simple statistical physics models
- Disabling External Influence in Social Networks via Edge Recommendation
- Reachable Space Characterization of Markov Decision Processes with Time Variability
- Slack Reactants: A State-Space Truncation Framework to Estimate Quantitative Behavior of the Chemical Master Equation
- GTH Algorithm, Censored Markov Chains, and -Factorization
- A First-Order Gradient Approach for the Connectivity Optimization of Markov Chains
- Linear least square method for the computation of the mean first passage times of ergodic markov chains