Reduction techniques for discrete-time Markov chains on totally ordered state space using stochastic comparisons
From MaRDI portal
Publication:4529142
Recommendations
- Reduction of Markov chains with two-time-scale state transitions
- On a new method of Markov chain reduction
- Reduced System Algorithms for Markov Chains
- Optimizing steady state Markov chains by state reduction
- Partial Order Reduction for Markov Decision Processes: A Survey
- The state reduction and related algorithms and their applications to the study of Markov chains, graph theory, and the optimal stopping problem
- On the reduction property of the number of \(H\)-equivalent tuples of states in a discrete Markov chain
Cited in
(10)- Stochastic performance bounds by state space reduction
- Dirac-based reduction techniques for quantitative analysis of discrete-time Markov models
- On the reduction property of the number of \(H\)-equivalent tuples of states in a discrete Markov chain
- An algorithm approach to bounding aggregations of multidimensional Markov chains
- Algorithms for an irreducible and lumpable strong stochastic bound
- Space Reduction for a Class of Multidimensional Markov Chains: A Summary and Some Applications
- Comparing Markov chains: aggregation and precedence relations applied to sets of states, with applications to assemble-to-order systems
- Stochastic Bounds for Partially Generated Markov Chains: An Algebraic Approach
- The state reduction and related algorithms and their applications to the study of Markov chains, graph theory, and the optimal stopping problem
- Censoring Markov Chains and Stochastic Bounds
This page was built for publication: Reduction techniques for discrete-time Markov chains on totally ordered state space using stochastic comparisons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4529142)
