Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering

DOI10.1016/J.EJOR.2001.09.001zbMath1141.60360OpenAlexW2124221524MaRDI QIDQ1771369

Denizhan N. Alparslan, Nihal Pekergin, Tuǧrul Dayar

Publication date: 21 April 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/23983

zbMATH Keywords

Markov processesAggregationStochastic comparisonNear complete decomposabilityReorderings

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)

Related Items (2)

Stochastic Bounds for Partially Generated Markov Chains: An Algebraic Approach ⋮ Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering

Uses Software

• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Monotone matrices and monotone Markov processes
• Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering
• Stochastically minimizing the makespan in two-machine flow shops without blocking
• Regenerative Analysis and Steady State Distributions for Markov Chains
• Stochastic Orderings for Markov Processes on Partially Ordered Spaces
• Bounds for the Positive Eigenvectors of Nonnegative Matrices and for their Approximations by Decomposition
• Stochastic Complementation, Uncoupling Markov Chains, and the Theory of Nearly Reducible Systems
• Near Complete Decomposability: Bounding the Error by a Stochastic Comparison Method
• Comparison of Partitioning Techniques for Two-Level Iterative Solvers on Large, Sparse Markov Chains
• Stochastic performance bounds by state space reduction
• On the Effects of Using the Grassmann–Taksar–Heyman Method in Iterative Aggregation–Disaggregation

This page was built for publication: Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering