Discrete time methods for simulating continuous time Markov chains
- 1 June 1976
- journal article
- research article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 8 (04), 772-788
- https://doi.org/10.1017/s0001867800042919
Abstract
This paper discusses several problems which arise when the regenerative method is used to analyse simulations of Markov chains. The first problem involves calculating the variance constant which appears in the central limit theorem used to obtain confidence intervals. Knowledge of this constant is very helpful in evaluating simulation methodologies. The second problem is to devise a method for simulating continuous time Markov chains without having to generate exponentially distributed holding times. Several methods are presented and compared. Numerical examples are given to illustrate the computional and statistical efficiency of these methods.Keywords
This publication has 7 references indexed in Scilit:
- Simulating stable stochastic systems, V: Comparison of ratio estimatorsNaval Research Logistics Quarterly, 1975
- Simulating Stable Stochastic Systems: III. Regenerative Processes and Discrete-Event SimulationsOperations Research, 1975
- Simulating Stable Stochastic Systems, II: Markov ChainsJournal of the ACM, 1974
- Simulating Stable Stochastic Systems, I: General Multiserver QueuesJournal of the ACM, 1974
- Denumerable Markov processes with bounded generators: a routine for calculating pij(∞)Journal of Applied Probability, 1971
- Markov renewal theoryAdvances in Applied Probability, 1969
- Ein Wartesystem mit zwei parallelen WarteschlangenComputing, 1968