A Revised Stochastic Complementation Algorithm for Nearly Completely Decomposable Markov Chains

DOI10.1287/IJOC.7.2.117zbMATH Open0858.60064OpenAlexW2110831017MaRDI QIDQ4896440FDOQ4896440

Authors: 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

Recommendations

• Stochastic Complementation, Uncoupling Markov Chains, and the Theory of Nearly Reducible Systems
• Iterative Methods for Computing Stationary Distributions of Nearly Completely Decomposable Markov Chains
• scientific article; zbMATH DE number 663840
• Comparacion numerica de algoritmos para calcular distribuciones estacionarias de cadenas de Markov finitas

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)

Cited In (5)

• Title not available (Why is that?)
• Stochastic Complementation, Uncoupling Markov Chains, and the Theory of Nearly Reducible Systems
• Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4896440)