Discrete-time conversion for simulating semi-Markov processes

  • Authors:
  • Bennett L. Fox;Peter W. Glynn

  • Affiliations:
  • Départment d'informatique et de Recherche Opérationelle, Université de Montréal, C.P. 6128, Succursale A, Montréal, Que., Canada H3C 3J7;Mathematics Research Center and Department of Industrial Engineering, University of Wisconsin-Madison, WI 53706, USA

  • Venue:
  • Operations Research Letters
  • Year:
  • 1986

Quantified Score

Hi-index 0.00

Visualization

Abstract

We simulate long-run averages of time integrals of a recurrent semi-Markov process efficiently. Converting to discrete-time by simulating only an imbedded chain and computing the conditional expectations of everything else needed given the sequence of studies visited reduces asymptotic variance, eliminates generating holding-time variates, and (when advantageous) gets rid of the future event schedule. In this setting, uniformizing continuous-time Markov chains is not worthwhile. We generalize beyond semi-Markov processes and cut ties to regenerative simulation methodology. Implementation of discrete-time conversion is discussed. It often requires no more work or even less work than the naive method. We give sufficient conditions for work savings. Continuous-time Markov chains, for example, satisfy them.