RUS  ENG
Полная версия
ЖУРНАЛЫ // Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica // Архив

Bul. Acad. Ştiinţe Repub. Mold. Mat., 2010, номер 1, страницы 77–91 (Mi basm251)

Эта публикация цитируется в 2 статьях

Research articles

An approach for determining the matrix of limiting state probabilities in discrete Markov processes

Dmitrii Lozovanu, Alexandru Lazari

Institute of Mathematics and Computer Science, Chişinău, Moldova

Аннотация: 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(n^4)$, where $n$ is the number of the states of the discrete system.

Ключевые слова и фразы: discrete Markov process, Markov chains, dynamic programming, the matrix of limiting states probabilities, polynomial time algorithm.

MSC: 65C40, 60J22, 90C39, 90C40

Поступила в редакцию: 17.12.2009

Язык публикации: английский



Реферативные базы данных:


© МИАН, 2024