Simplicial algorithms for computing stationary probabilities of stochastic matrices

作者:

Highlights:

摘要

The so called simplicial algorithms are put into use to compute the stationary probability distributions of stochastic matrices. This is a typical example of application of simplicial algorithms to compute the fixed points of a continuous map (Brouwer's theorem). We further demonstrate the variable grid refinement approach involved in the simplicial algorithms. The variable grid refinement scheme gives good accuracy and acceptable average computational complexity.

论文关键词:Simplicial algorithms,Brouwer fixed point,Stochastic matrices,Markov chains

论文评审过程:Available online 10 September 1998.

论文官网地址:https://doi.org/10.1016/S0096-3003(97)10097-2