RO EN
An Approach for Determining the Matrix of Limiting State Probabilities in Discrete Markov Processes.
Authors: Lozovanu Dmitrii, Alexandru Lazari
– 0.15 Mb
Abstract
A new approach for determining the matrix of limiting state probabilities in Markov processes is proposed and a polynomial time algorithm for calculating this matrix is grounded. The computational complexity of the algorithm is O(n4) where n is the number of the states of the discrete system.E-mail: ,
Fulltext
– 0.15 Mb
Contents
- Towards Structural Network Analysis.
- About characteristics of graded algebras S1,4 and SI1,4.
- A probabilistic method for solving minimax problems with general constraints.
- About rings of continuous functions in the expanded field of numbers.
- On preradicals associated to principal functors of module categories. III.
- Invariant transformations of loop transversals. 1. The case of isomorphism.
- An Approach for Determining the Matrix of Limiting State Probabilities in Discrete Markov Processes.
- Numerical modeling of multidimensional problems of gravitational gas dynamics with high resolution schemes.
- On the action of differentiation operator in some classes of Nevanlinna-Djrbashian type in the unit disk and polydisk.
- On a Product of Classes of Algebraic Systems.
