Abstract:
The problem of determining the transient and differential matrices in finite Markov processes is considered. New polynomial time algorithms for determining the considered matrices in Markov chains are proposed and grounded. The proposed algorithms find the limit and differential matrices efficiently when the characteristic values of the matrix of probability transition are known; the running time of the algorithms is $O(n^4)$, where $n$ is the number of the states of dynamical system in the Markov process.
Keywords and phrases:finite Markov process, Markov chain, transient matrix, differential matrix, polynomial time algorithm, stationary recurrent process.
Fulltext:
PDF file (254 kB)