Hostname: page-component-78c5997874-xbtfd Total loading time: 0 Render date: 2024-11-13T02:55:23.192Z Has data issue: false hasContentIssue false
  • English
  • Français

A Note on Error Bounds for Approximating Transition Probabilities in Continuous-time Markov Chains

Published online by Cambridge University Press:  27 July 2009

Nico M. van Dijk
Nico M. van Dijk
Affiliation:
Department of EconometricsFree University, Amsterdam, The Netherlands
Get access Rights & Permissions [Opens in a new window]

Abstract

Recently, Ross [1] proposed an elegant method of approximating transition probabilities and mean occupation times in continuous-time Markov chains based upon recursively inspecting the process at exponential times. The method turned out to be amazingly efficient for the examples investigated. However, no formal rough error bound was provided. Any error bound even though robust is of practical interest in engineering (e.g., for determining truncation criteria or setting up an experiment). This note primarily aims to show that by a simple and standard comparison relation a rough error bound of the method is secured. Also, some alternative approximations are inspected.

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 2 , Issue 4 , October 1988 , pp. 471 - 474
Copyright
Copyright © Cambridge University Press 1988

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Ross, S.M. (1987). Approximating transition probabilities and mean occupation times in continuous-time Markov chains. Probability in the Engineering and Informational Sciences I: 251–264.Google Scholar
2.Kohlas, J. (1982). Stochastic methods of operations research. Cambridge: Cambridge University Press.Google Scholar
3.Lax, P.D. & Richtmeyer, R.P. (1956). Survey of the stability of linear finite-difference equations. Communication in Pure and Applied Mathematics 9: 267–293.CrossRefGoogle Scholar
4.van, Dijk N.M. (1984). Controlled Markov processes: time-discretization. CWI Tract II, Mathematical Center, Amsterdam, The Netherlands.Google Scholar
5.van, Dijk N.M. & Puterman, M.L. (1985). Perturbation theory for Markov processes with applications to queueing systems. Advances in Applied Probability, 20: 79–98.Google Scholar