Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH
 QUICK SEARCH:   [advanced]


     


OPERATIONS RESEARCH,
Published online in Articles in Advance, October 28, 2009
DOI: 10.1287/opre.1090.0738
This Article
Right arrow Full Text (PDF)
Right arrow e-companion
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Google Scholar
Right arrow Articles by Heidergott, B.
Right arrow Articles by Leder, N.

Series Expansions for Continuous-Time Markov Processes

Bernd Heidergott, Arie Hordijk, Nicole Leder

Department of Econometrics, Vrije Universiteit Amsterdam, and Tinbergen Institute, 1081 HV Amsterdam, The Netherlands
Mathematical Institute, Leiden University, 2300 RA Leiden, The Netherlands
Department of Mathematics, University of Hamburg, 20146 Hamburg, Germany

bheidergott{at}feweb.vu.nl
hordijk{at}math.leidenuniv.nl
nicole.leder{at}studium.uni-hamburg.de

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.

Subject classifications: probability; Markov processes; queues; algorithms; numerical methods; retrial queue; deviation matrix; sensitivity analysis.
History: Received August 2007; revision received November 2008; accepted March 2009.







HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH
Copyright © 2009 by INFORMS.