Hostname: page-component-7dd5485656-s6l46 Total loading time: 0 Render date: 2025-10-31T12:31:38.461Z Has data issue: false hasContentIssue false
  • English
  • Français

On a simple proof of uniformization for continuous and discrete-state continuous-time Markov chains

Published online by Cambridge University Press:  01 July 2016

Nico M. Van dijk
Nico M. Van dijk*
Affiliation:
Free University, Amsterdam
*
∗Postal address: Department of Econometrics, Free University, De Boelelaán 1105, 1081 HV Amsterdam, The Netherlands.
Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'

Information

Type
Letters to the Editor
Information
Advances in Applied Probability , Volume 22 , Issue 3 , September 1990 , pp. 749 - 750
Copyright
Copyright © Applied Probability Trust 1990 

References

[1] Billingsley, P. (1968) Convergence of Probability Measures. Wiley, New York.Google Scholar
[2] Gihman, I. I. and Skorohod, A. V. (1969) Introduction to the Theory of Random Processes. W. B. Saunders, Philadelphia.Google Scholar
[3] Gihman, I. I. and Skorohod, A. V. (1975) The Theory of Stochastic Processes II. Springer-Verlag, Berlin.Google Scholar
[4] Grassman, W. (1990) Finding transient solutions in Markovian event systems through randomization. Proc. First Internat. Conf. on the Numerical Solution of Markov Chains, January 8–10, Raleigh, North Carolina, 375–385.Google Scholar
[5] Gross, D. and Miller, D. R. (1984) The randomization technique as a modeling tool and solution procedure for transient Markov processes. Operat. Res. 32, 343–361 Google Scholar
[6] Jensen, A. (1953) Markoff chains as an aid in the study of Markoff processes. Skand. Aktuarietidskr. 36, 87–91.Google Scholar
[7] Heidelberger, P. and Goyal, A. (1988) Sensitivity analysis of continuous time Markov chains using uniformization. In Computer Performance and Reliability, ed. Iazeolla, G., Courtois, P. J., and Boxma, O. J., Elsevier North-Holland, Amsterdam, 93–104.Google Scholar
[8] Melamed, B. and Yadin, M. (1984) Randomization procedures in the computation of cumulative-time distributions over discrete state Markov processes. Operat. Res. 32, 926–943.Google Scholar