Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering
Date
2005
Authors
Pekergin, N.
Dayar T.
Alparslan, D. N.
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Citation Stats
Series
Abstract
Source Title
European Journal of Operational Research
Publisher
Elsevier
Course
Other identifiers
Book Title
Keywords
Aggregation, Markov processes, Near complete decomposability, Reorderings, Stochastic comparison, Algorithms, Eigenvalues and eigenfunctions, Linear equations, Markov processes, Matrix algebra, Poisson distribution, Probability, Problem solving, Queueing networks, Vectors, Markov modulated Poisson process (MMPP), Near complete decomposability, Reordering, Stochastic comparison, Operations research
Degree Discipline
Degree Level
Degree Name
Citation
Permalink
Published Version (Please cite this version)
Language
English