A New Algorithm for Computing the Ergodic Probability Vector for Large Markov Chains
From MaRDI portal
Publication:3415960
DOI10.1017/S0269964800001479zbMath1134.60361MaRDI QIDQ3415960
Publication date: 19 January 2007
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Continuous-time Markov processes on discrete state spaces (60J27)
Related Items (3)
Approximations for multi-server queues: System interpolations ⋮ Replacement process decomposition for discounted Markov renewal programming ⋮ Asymptotic Expansions for Stationary Distributions of Perturbed Semi-Markov Processes
Cites Work
- Unnamed Item
- Unnamed Item
- Markov chain models - rarity and exponentiality
- Finite Markov chain models skip-free in one direction
- Bounds for the Positive Eigenvectors of Nonnegative Matrices and for their Approximations by Decomposition
- Iterative aggregation/disaggregation techniques for nearly uncoupled markov chains
- Aggregation with an error of O (ε 2 )
- Aggregation/Disaggregation Methods for Computing the Stationary Distribution of a Markov Chain
- Lumpability and time reversibility in the aggregation-disaggregation method for large markov chains
- Birth-and-death processes on the integers with phases and general boundaries
- Exact Aggregation in Exponential Queueing Networks
- Representation Theory for Denumerable Markov Chains
This page was built for publication: A New Algorithm for Computing the Ergodic Probability Vector for Large Markov Chains