Error Analysis in Nearly-Completely Decomposable Stochastic Systems
From MaRDI portal
Cited in
(11)- On polyhedra of Perron-Frobenius eigenvectors
- Steady state solution and convergence rate of time-dependent Markov chains of queuing networks
- A decomposable model of program paging behaviour
- Approximation of eigencharacteristics in nearly-completely decomposable stochastic systems
- Estimating equilibrium probabilities for band diagonal Markov chains using aggregation and disaggregation techniques
- Spectral clustering for non-reversible Markov chains
- Asymptotic expansions for stationary distributions of perturbed semi-Markov processes
- Iterative Methods for Computing Stationary Distributions of Nearly Completely Decomposable Markov Chains
- An Approximation to the Stationary Distribution of a Nearly Completely Decomposable Markov Chain and Its Error Analysis
- An Approximation to the Stationary Distribution of a Nearly Completely Decomposable Markov Chain and Its Error Bound
- Proof of the Simon-Ando Theorem
This page was built for publication: Error Analysis in Nearly-Completely Decomposable Stochastic Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4099114)