Reduction techniques for discrete-time Markov chains on totally ordered state space using stochastic comparisons

DOI10.1239/jap/1014842837zbMath0971.60022OpenAlexW2059682626MaRDI QIDQ4529142

Laurent Truffet

Publication date: 30 October 2001

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1239/jap/1014842837

zbMATH Keywords

transient analysisstrong orderexact and ordinary lumpability

Mathematics Subject Classification ID

Numerical analysis or methods applied to Markov chains (65C40) Distribution theory (60E99)

Related Items (3)

Stochastic Bounds for Partially Generated Markov Chains: An Algebraic Approach ⋮ Algorithms for an irreducible and lumpable strong stochastic bound ⋮ An algorithm approach to bounding aggregations of multidimensional Markov chains

This page was built for publication: Reduction techniques for discrete-time Markov chains on totally ordered state space using stochastic comparisons