Inverse-transformation algorithms for some common stochastic processes

Authors:
B. Schmiser;W.-M. Tina Song
Affiliations:
-;-
Venue:
WSC '89 Proceedings of the 21st conference on Winter simulation
Year:
1989

Citing 0
Cited 6

Determining job completion time distributions in stochastic production environments

WSC '95 Proceedings of the 27th conference on Winter simulation
Advanced input modeling for simulation experimentation

Proceedings of the 31st conference on Winter simulation: Simulation---a bridge to the future - Volume 1
Alternative approaches for specifying input distributions and processes (panel session)

WSC' 90 Proceedings of the 22nd conference on Winter simulation
Simulation output analysis via dynamic batch means

Proceedings of the 32nd conference on Winter simulation
Analysis methodology: are we done?

WSC '05 Proceedings of the 37th conference on Winter simulation
Monitoring variability of autocorrelated processes using standardized time series variance estimators

Proceedings of the 38th conference on Winter simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Realizations from common stochastic processes are often used by simulation-methodology researchers in Monte Carlo performance evaluation of new and existing methods for output analysis, variance reduction, and optimization. Typically realizations can be obtained easily from either the definition or simple properties of the process. We discuss using the inverse of the distribution function for generating realizations from some of these processes. The inverse transformation always possesses the advantage of correlation induction, useful for variance reduction. We consider the discrete-time processes ARMA, EAR, M/M/1-QT (time in queue), and M/M/1-ST (time in system, the sojourn time), and Markov chains. The inverse-transformation algorithms are sometimes slower (e.g., ARMA, M/M/1-ST), sometimes faster (e.g., M/M/1-QT), and often about the same speed as the usual algorithm. Some Fortran implementations are provided.