RO EN
Algorithms for Determining the Transient and Differential Matrices in Finite Markov Processes
Authors: Alexandru Lazari
– 0.18 Mb
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(n4), where n is the number of the states of dynamical system in the Markov process.E-mail:
Fulltext
– 0.18 Mb
Contents
- Properties of final unrefinable chains of groups topologies
- On subsemimodules of semimodules
- Abstract complexes, their homologies and applications
- A criterion for parametrical completeness in the 8-valued algebraic model of modal logic S5
- On Solvability of one Class of Hammerstein Nonlinear Integral Equations
- Algorithms for Determining the Transient and Differential Matrices in Finite Markov Processes
- On the centralizers of finite subgroups in quasi-HNN groups
- New Inequalities of Hardy-Hilbert Type
- On the Diophantine equation xxyyk(y)=zzp
