Near Complete Decomposability: Bounding the Error by a Stochastic Comparison Method
From MaRDI portal
Recommendations
- An Approximation to the Stationary Distribution of a Nearly Completely Decomposable Markov Chain and Its Error Bound
- An Approximation to the Stationary Distribution of a Nearly Completely Decomposable Markov Chain and Its Error Analysis
- Aggregation with an error of O (ε 2 )
- Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering
- Geometric bounds on iterative approximations for nearly completely decomposable Markov chains
Cited in
(11)- Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering
- Deciding separability with a fixed error
- State space truncation with quantified errors for accurate solutions to discrete chemical master equation
- scientific article; zbMATH DE number 5968919 (Why is no real title available?)
- Stochastic Bounds for Partially Generated Markov Chains: An Algebraic Approach
- Aggregation with an error of O (ε 2 )
- An Approximation to the Stationary Distribution of a Nearly Completely Decomposable Markov Chain and Its Error Bound
- Transforming stochastic matrices for stochastic comparison with the st-order
- Iterative component-wise bounds for the steady-state distribution of a Markov chain.
- Accurate chemical master equation solution using multi-finite buffers
- On certain computable tests and componentwise error bounds
This page was built for publication: Near Complete Decomposability: Bounding the Error by a Stochastic Comparison Method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4361806)
