A Revised Stochastic Complementation Algorithm for Nearly Completely Decomposable Markov Chains

DOI10.1287/ijoc.7.2.117zbMath0858.60064OpenAlexW2110831017MaRDI QIDQ4896440

R. Bruce Mattingly

Publication date: 23 March 1997

Published in: ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.7.2.117

zbMATH Keywords

ill-conditionedstationary distribution vectorloosely-coupled Markov chains

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)

Related Items (2)

Modularity revisited: a novel dynamics-based concept for decomposing complex networks ⋮ Eigenvalue bounds on restrictions of reversible nearly uncoupled Markov chains

This page was built for publication: A Revised Stochastic Complementation Algorithm for Nearly Completely Decomposable Markov Chains