Scientific Applications: An algorithm for identifying the ergodic subchains and transient states of a stochastic matrix

39Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

An algorithm for identifying the ergodic subchains and transient states of a stochastic matrix is presented. Applications in Markov renewal programming and in the construction of variable length codes are reviewed, and an updating procedure for dealing with certain sequences of stochastic matrices is discussed. Computation times are investigated experimentally and compared with those of another recently proposed method. © 1968, ACM. All rights reserved.

Cited by Powered by Scopus

Markov decision processes: Discrete stochastic dynamic programming

7270Citations
N/AReaders
Get full text

Decision-Theoretic Planning: Structural Assumptions and Computational Leverage

733Citations
N/AReaders
Get full text

A First Course in Stochastic Models

658Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Fox, B. L., & Landi, D. M. (1968). Scientific Applications: An algorithm for identifying the ergodic subchains and transient states of a stochastic matrix. Communications of the ACM, 11(9), 619–621. https://doi.org/10.1145/364063.364082

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 2

40%

Professor / Associate Prof. 1

20%

Lecturer / Post doc 1

20%

Researcher 1

20%

Readers' Discipline

Tooltip

Computer Science 3

60%

Philosophy 1

20%

Business, Management and Accounting 1

20%

Save time finding and organizing research with Mendeley

Sign up for free