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

Authors:
B. L. Fox;D. M. Landi
Affiliations:
The RAND Corp., Santa Monica, CA;The RAND Corp., Santa Monica, CA
Venue:
Communications of the ACM
Year:
1968

Citing 0
Cited 6

Building correct simulation models is difficult

WSC '92 Proceedings of the 24th conference on Winter simulation
Computational issues for accessibility in discrete event simulation

ACM Transactions on Modeling and Computer Simulation (TOMACS)
Resource-driven mission-phasing techniques for constrained agents in stochastic environments

Journal of Artificial Intelligence Research
Decentralized dynamic spectrum allocation based on adaptive antenna array interference mitigation diversity

IEEE Transactions on Signal Processing
Structured reachability analysis for Markov decision processes

UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
Brief paper: Stochastic control of paging in a two-level computer memory

Automatica (Journal of IFAC)

Quantified Score

Hi-index	48.22

Visualization

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.