2006 · 15 citations · 5 references
EngineeringComputer ScienceMathematicsAlgorithmsProbability TheoryStochastic ProcessesDiscrete-time Stochastic ProcessesMarkov ChainsMarkov ModelingMarkov ProcessesProbability InequalitiesSteady-state AnalysisConditional Lower BoundsDiscrete-time Markov ChainsDiscrete-time Markov ProcessesFinite Markov ChainsFinite-state Markov ChainsMarkov Chain Steady StateMarkov StatesStrong Markov Property
The problem of computing bounds on the conditional steady-state probability vector of a subset of states in finite, ergodic discrete-time Markov chains (DTMCs) is considered. An improved algorithm utilizing the strong stochastic (st-)order is given. On standard benchmarks from the literature and other examples, it is shown that the proposed algorithm performs better than the existing one in the strong stochastic sense. Furthermore, in certain cases the conditional steady-state probability vector of the subset under consideration can be obtained exactly.
5