Stochastic Bounds for Partially Generated Markov Chains: An Algebraic Approach
From MaRDI portal
Publication:3543321
DOI10.1007/978-3-540-87412-6_17zbMath1180.60059OpenAlexW1503155725MaRDI QIDQ3543321
Jean-Michel Fourneau, Ana Bušić
Publication date: 2 December 2008
Published in: Computer Performance Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-87412-6_17
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Sub-stochastic matrix analysis for bounds computation -- theoretical results
- Algorithms for an irreducible and lumpable strong stochastic bound
- Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering
- Censoring Markov Chains and Stochastic Bounds
- Worst Case Analysis of Batch Arrivals with the Increasing Convex Ordering
- Stochastic Complementation, Uncoupling Markov Chains, and the Theory of Nearly Reducible Systems
- Near Complete Decomposability: Bounding the Error by a Stochastic Comparison Method
- Transforming stochastic matrices for stochastic comparison with the st-order
- Reduction techniques for discrete-time Markov chains on totally ordered state space using stochastic comparisons
- The censored Markov chain and the best augmentation
This page was built for publication: Stochastic Bounds for Partially Generated Markov Chains: An Algebraic Approach