Technical Note—A Markov Chain Partitioning Algorithm for Computing Steady State Probabilities

From MaRDI portal
Publication:3686459

DOI10.1287/opre.33.1.228zbMath0569.90092OpenAlexW1966781403MaRDI QIDQ3686459

Theodore J. Sheskin

Publication date: 1985

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.33.1.228




Related Items (19)

The computation of key properties of Markov chains via perturbationsOptimal Stopping of Seasonal Observations and Projection of a Markov ChainPerfect simulation of steady-state Markov chain on mixed state spaceComputing absorption probabilities for a Markov chainComparacion numerica de algoritmos para calcular distribuciones estacionarias de cadenas de Markov finitasComputation of the steady-state probability of Markov chain evolving on a mixed state spaceSusceptible-exposed-infectious model using Markov chainsAsymptotic Expansions for Stationary Distributions of Perturbed Semi-Markov ProcessesA partitioning algorithm for solving systems of linear equationsComputing mean first passage times for a Markov chainAggregation of Markov flows I: theoryThe computation of the mean first passage times for Markov chainsComputing the fundamental matrix for a nonirreducible Markov chainMatrix inversion by augmentation and reductionThe Markov chain tree theorem in commutative semirings and the state reduction algorithm in commutative semifieldsParallel computing for Markov chains with islands and portsThe state reduction and related algorithms and their applications to the study of Markov chains, graph theory, and the optimal stopping problemState reduction in a Markov decision processAccurate calculations of stationary distributions and mean first passage times in Markov renewal processes and Markov chains




This page was built for publication: Technical Note—A Markov Chain Partitioning Algorithm for Computing Steady State Probabilities