Refinable bounds for large Markov chains
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 956812
- scientific article; zbMATH DE number 19248
- A Method to Calculate Steady-State Distributions of Large Markov Chains by Aggregating States
- Computing bounds on steady state availability of repairable computer systems
- scientific article; zbMATH DE number 19247
Cited in
(13)- Algorithms for an irreducible and lumpable strong stochastic bound
- Comparing Markov chains: aggregation and precedence relations applied to sets of states, with applications to assemble-to-order systems
- An efficient and numerically stable method for computing bounds for the interval availability distribution
- Untold Horrors About Steady-State Probabilities: What Reward-Based Measures Won’t Tell About the Equilibrium Distribution
- Stochastic Bounds for Partially Generated Markov Chains: An Algebraic Approach
- Spectral and graph-theoretic bounds on steady-state-probability estimation performance for an ergodic Markov chain
- Bounds for performance characteristics: a systematic approach via cost structures
- Stochastic performance bounds by state space reduction
- An iterative bounding method for stochastic automata networks
- Bounding reward measures of Markov models using the Markov decision processes.
- Iterative component-wise bounds for the steady-state distribution of a Markov chain.
- Stationary distributions of continuous-time Markov chains: a review of theory and truncation-based approximations
- scientific article; zbMATH DE number 956812 (Why is no real title available?)
This page was built for publication: Refinable bounds for large Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4421170)
