• Graduate Programs
  • Research
  • Browse our Courses
  • Events
    • Events Calendar
    • Events Archive
    • Summer School
      • Applied Public Policy Evaluation
      • Deep Learning
      • Development Economics
      • Economics of Blockchain and Digital Currencies
      • Economics of Climate Change
      • The Economics of Crime
      • Foundations of Machine Learning with Applications in Python
      • From Preference to Choice: The Economic Theory of Decision-Making
      • Inequalities in Health and Healthcare
      • Marketing Research with Purpose
      • Markets with Frictions
      • Modern Toolbox for Spatial and Functional Data
      • Sustainable Finance
      • Tuition Fees and Payment
      • Business Data Science Summer School Program
    • Tinbergen Institute Lectures
    • 2026 Tinbergen Institute Opening Conference
    • Annual Tinbergen Institute Conference
  • News
  • Summer School
    • Applied Public Policy Evaluation
    • Deep Learning
    • Development Economics
    • Economics of Blockchain and Digital Currencies
    • Economics of Climate Change
    • The Economics of Crime
    • Foundations of Machine Learning with Applications in Python
    • From Preference to Choice: The Economic Theory of Decision-Making
    • Inequalities in Health and Healthcare
    • Marketing Research with Purpose
    • Markets with Frictions
    • Modern Toolbox for Spatial and Functional Data
    • Sustainable Finance
    • Tuition Fees and Payment
  • Alumni

Heidergott, B., Hordijk, A. and Leder, N. (2010). Series expansions for continuous-time Markov chains Operations Research, 58:756--767.

  • Journal
    Operations Research
View publication

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. {\textcopyright} 2010 INFORMS.