An algorithm approach to bounding aggregations of multidimensional Markov chains
DOI10.1016/J.TCS.2012.05.030zbMATH Open1247.68194OpenAlexW2033789249MaRDI QIDQ714783FDOQ714783
Authors: Hind Castel-Taleb, Lynda Mokdad, Nihal Pekergin 
Publication date: 11 October 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.05.030
Recommendations
- scientific article; zbMATH DE number 830005
- scientific article; zbMATH DE number 4044894
- scientific article; zbMATH DE number 1848276
- An aggregation/disaggregation algorithm for computing the stationary distribution of a large markov chain
- scientific article; zbMATH DE number 4060467
- scientific article; zbMATH DE number 19229
- Aggregation of Markov chains
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Title not available (Why is that?)
- Comparison methods for stochastic models and risks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Queueing Networks and Markov Chains
- Stochastic comparison of queueing networks
- Title not available (Why is that?)
- A simple coupling of renewal processes
- Stochastic Orderings for Markov Processes on Partially Ordered Spaces
- A coupling technique for stochastic comparison of functions of Markov processes
- Bounds on the end-to-end loss probability for queues in Series with Finite Capacity
- Reduction techniques for discrete-time Markov chains on totally ordered state space using stochastic comparisons
- Stochastic Monotonicities in Jackson Queueing Networks
Cited In (5)
- The finest level acceleration of multilevel aggregation for Markov chains
- Space Reduction for a Class of Multidimensional Markov Chains: A Summary and Some Applications
- Guaranteed approximation of Markov chains with applications to multiplexer engineering in ATM networks
- Comparing Markov chains: aggregation and precedence relations applied to sets of states, with applications to assemble-to-order systems
- Optimal Kullback-Leibler Aggregation via Spectral Theory of Markov Chains
This page was built for publication: An algorithm approach to bounding aggregations of multidimensional Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714783)
