Series Expansions for Continuous-Time Markov Processes
- 1 June 2010
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 58 (3), 756-767
- https://doi.org/10.1287/opre.1090.0738
Abstract
We present update formulas that allow us to express the stationary distribution of a continuous-time Markov process with denumerable state space having generator matrix Q* through a continuous-time Markov process with generator matrix Q. Under suitable stability conditions, numerical approximations can be derived from the update formulas, and we show that the algorithms converge at a geometric rate. Applications to sensitivity analysis and bounds on perturbations are discussed as well. Numerical examples are presented to illustrate the efficiency of the proposed algorithm.This publication has 27 references indexed in Scilit:
- Retrial Queueing SystemsPublished by Springer Science and Business Media LLC ,2008
- SERIES EXPANSIONS FOR FINITE-STATE MARKOV CHAINSProbability in the Engineering and Informational Sciences, 2007
- Perturbation analysis for denumerable Markov chains with application to queueing modelsAdvances in Applied Probability, 2004
- Taylor series expansions for stationary Markov chainsAdvances in Applied Probability, 2003
- Telephone Call Centers: Tutorial, Review, and Research ProspectsManufacturing & Service Operations Management, 2003
- THE DEVIATION MATRIX OF A CONTINUOUS-TIME MARKOV CHAINProbability in the Engineering and Informational Sciences, 2002
- The Maclaurin series for performance functions of Markov chainsAdvances in Applied Probability, 1998
- Perturbation realization, potentials, and sensitivity analysis of Markov processesIEEE Transactions on Automatic Control, 1997
- Retrial QueuesPublished by Springer Science and Business Media LLC ,1997
- A survey of retrial queuesQueueing Systems, 1990