Stochastic Bounds for Partially Generated Markov Chains: An Algebraic Approach
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1946759 (Why is no real title available?)
- Algorithms for an irreducible and lumpable strong stochastic bound
- Censoring Markov Chains and Stochastic Bounds
- Comparison methods for stochastic models and risks
- Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering
- Near Complete Decomposability: Bounding the Error by a Stochastic Comparison Method
- Reduction techniques for discrete-time Markov chains on totally ordered state space using stochastic comparisons
- Stochastic Complementation, Uncoupling Markov Chains, and the Theory of Nearly Reducible Systems
- Sub-stochastic matrix analysis for bounds computation -- theoretical results
- The censored Markov chain and the best augmentation
- Transforming stochastic matrices for stochastic comparison with the st-order
- Worst Case Analysis of Batch Arrivals with the Increasing Convex Ordering
This page was built for publication: Stochastic Bounds for Partially Generated Markov Chains: An Algebraic Approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3543321)