Abstract
Virtually every commercially available product for performing discrete-event simulation incorporates software for sampling from diverse probability distributions. Often, this incorporation is relatively seamless, requiring the user merely to pull down a menu of options, select a distribution, and specify its parameters. This major convenience relieves the user of the need to write her or his code to effect sampling.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abramowitz, M., and I. Stegun (1964). Handbook of Mathematical Functions, Applied Mathematics Series 55, National Bureau of Standards, Washington, D.C.
Afflerbach, L., and W. Hörmann (1990). Nonuniform random numbers: a sensitivity analysis for tranformation methods, Lecture Notes in Economics and Mathematical Systems, G. Plug and U. Dieter, eds., Springer-Verlag, New York.
Agrawal, A., and A. Satyanarayana (1984). An O (le I) time algorithm for computing the reliability of a class of directed networks, Oper. Res., 32, 493–515.
Aho, A.V., J.E. Hoperoft, and J.D. Ullman (1974). The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA.
Ahrens, J.H. (1989). How to avoid logarithms in comparisons with uniform random variables, Computing, 41, 163–166.
Ahrens, J.H. (1993). Sampling from general distributions by suboptimal division of domains, Grazer Math. Berichte 319, Graz, Austria.
Ahrens, J.H., and U. Dieter (1972). Computer methods for sampling from the exponential and normal distributions, Comm. ACM, 15, 873–882.
Ahrens, J.H., and U. Dieter (1974a). Non-Uniform Random-Numbers, Institut für Math. Statistik, Technische Hochschule in Graz, Austria.
Ahrens, J.H., and U. Dieter (1974b). Computer methods for sampling from Gamma Beta, Poisson and binomial distributions, Computing, 12, 223–246.
Ahrens, J.H., and U. Dieter (1980a). Sampling from the binomial and Poisson distributions: a method with bounded computation times, Computing, 25, 193–208.
Ahrens, J.H., and U. Dieter (1982a). Generating Gamma variates by a modified rejection technique, Comm. ACM, 25, 47–53.
Ahrens, J.H., and U. Dieter (1982b). Computer generation of Poisson deviates from modified normal distributions, ACM Trans. Math. Software, 8, 163–179.
Ahrens, J.H., and U. Dieter (1985). Sequential random sampling, ACM Transactions on Mathematical Software, 11, 157–169.
Ahrens, J.H., and U. Dieter (1988). Efficient tablefree sampling methods for the exponential, Cauchy and normal distributions, Comm. ACM, 31, 1330–1337.
Ahrens, J.H., and U. Dieter (1991). A convenient sampling method with bounded computation times for Poisson distributions, The Frontiers of Statistical Computation, Simulation and Modeling. P.R. Nelson, E.J. Dudewicz, A.Öztürk, and E.C. van der Meulen, editors American Science Press, Syracuse, NY, 137–149.
Anderson, T.W. (1958). An Introduction to Multivariate Statistical Analysis, John Wiley and Sons.
Atkinson, A.C. (1979). The computer generation of Poisson random variables, Appl. Statist. 28, 29–35.
Atkinson, A.C., and J. Whittaker (1976). A switching algorithm for the generation of beta random variables with at least one parameter less than one, J. Roy. Statist. Soc., Series A, 139, 462–467.
Best, D.J. (1978). A simple algorithm for the computer generation of random samples from a Student’s t or symmetric beta distribution, Proceedings of the 1978 COMPSTAT Conference, Leiden, 341–347.
Best, D.J. (1983). A note on gamma variate generators with shape parameter less than unity, Computing, 30, 185–188.
Box, G.E.P., and M.E. Muller (1958). A note on the generation of random normal deviates, Ann. Math. Statist, 29, 610–611.
Broder, A.Z. (1989). Generating random spanning trees, Thirtieth Annual Symposium on Foundations of Computer Science, 442–447.
Broder, A.Z., and A.R. Karlin (1989). Bounds on the cover time, J. Theoretical Probability, 2, 101–120.
Chen, H-C., and Y. Asau (1974). On generating random variates from an empirical distribution, AILE Trans., No. 2, 6, 163–166.
Cheng, R.C.H. (1977). The generation of Gamma variables with nonintegral shape parameter, Appl. Stat., 26, 71–75.
Cheng, R.C.H. (1978). Generating beta variates with nonintegral shape parameters, Comm. ACM, 21, 317–322.
Cheng, R.C.H., and G.M. Feast (1979). Some simple Gamma variate generators,Appl. Statist., 28, 290–295.
Cheng, R.C.H., and G.M. Feast (1980). Gamma variate generators with increased shape parameter range, Comm. ACM, 23, 389–394.
Devroye, L. (1981). The computer generation of Poisson random variables, Computing, 26, 197–207.
Devroye, L. (1986). Non-Uniform Random Variate Generation, Springer-Verlag, New York.
Devroye, L. and A. Naderisamani (1980). A binomial variate generator, Tech. Rep., School of Computer Science, McGill University, Montreal.
Dieter, U. (1982). An alternate proof for the representation of discrete distributions by equiprobable mixtures, J. Appl. Prob., 19, 869–872.
Fishman, G.S., and L.R. Moore (1984). Sampling from a discrete distribution while preserving monotonicity, Amer. Statist., 38, 219–223.
Feller, W. (1971). An Introduction to Probability Theory and Its Applications, Volume II, second ed., Wiley, New York.
Fisher, R.A., and E.A. Cornish (1960). The percentile points of distributions having known cumulants, Technometrics, 2, 209–225.
Fishman, G.S. (1976). Sampling from the gamma distribution on a computer, Comm. ACM, 19, 407–409.
Fishman, G.S. (1978). Principles of Discrete Event Simulation, Wiley, New York.
Fishman, G.S. (1979). Sampling from the binomial distribution on a computer, J. Amer. Statist. Assoc., 74, 418–423.
Fishman, G.S. (1996). Monte Carlo: concepts, Algorithms and Applications, Springer-Verlag, New York.
Fishman, G.S., and L.R. Moore (1986). An exhaustive analysis of multiplicative congruential random number generators with modulus 231–1, SIAM J. Sci. Stat. Comput., 7, 24–45.
Fishman, G.S., and L.S. Yarberry (1993). Generating a sample from a k-cell table with changing probabilities in O(log2 k) time, ACM Trans. Math. Software, 19, 257–261.
Gerontidis, I., and R.L. Smith (1982). Monte Carlo generation of order statistics from general distributions, Appl. Statist, 31, 238–243.
Hastings, C., Jr. (1955). Approximations for Digital Computers, Princeton University Press, Princeton, NJ.
Hoeffding, W. (1940). Masstabinvariante Korrelationstheorie, Schriften des Mathematischen Instituts und des Instituts fürAngewandte, Mathematik der UniversitätBerlin, 5, 197–233.
Hoeffding, W. (1963). Probability inequalities for sums of bounded random variables, J. Amer. Statist. Assoc., 58, 13–29.
Hörmann, W., and G. Derflinger (1993). A portable random number generator well suited for the rejection method, ACM Transactions on Mathematical Software, 19, 489–495.
Johnson, N.L., S. Kotz, and N. Balakrishnan (1994). Continuous Univariate Distributions, Volume II, second edition, Wiley, New York.
Kachitvichyanukul, V., and B. Schmeiser (1985). Computer generation of hypergeometric random variates, J. Statist. Comp. Simul., 22, 127–145.
Kachitvichyanukul, V., and B. Schmeiser (1988). Binomial random variate generation, Comm. ACM, 31, 216–222.
Kinderman, A.J., and J.F. Monahan (1977). Computer generation of random variables using the ratio of uniform deviates, ACM Trans. Math. Software, 3, 257–260.
Kinderman, A.J., and J.F. Monahan (1980). New methods for generating Student’s t and Gamma variables, Computing, 25, 369–377.
Knuth, D. (1973). The Art of Computer Programming Sorting and Searching, Addison-Wesley, Reading, MA.
Kronmal, Richard A., and A.V. Peterson, Jr. (1979). On the alias method for generating random variables from a discrete distribution, The Amer. Statist., 4, 214–218.
Kulkarni, V.G. (1990). Generating random combinatorial objects, J. Algorithms, 11, 185–207.
Lurie, D., and H.O. Hartley (1972). Machine-generation of order statistics for Monte Carlo computations, The Amer. Statist., 26, 26–27.
MacLaren, M.D., G. Marsaglia, and T.A. Bray (1964). A fast procedure for generating exponential random variables, Comm. ACM, 7, 298–300.
Marsaglia, G. (1984). The exact-approximation method for generating random variables in a computer, J. Amer. Statist., 79, 218–221.
Marsaglia, G., K. Ananthanarayanan, and N.J. Paul (1976). Improvements on fast methods for generating normal random variables, Inf. Proc. Letters, 5, 27–30.
Marsaglia, G., M.D. MacLaren, and T.A. Bray (1964). A fast procedure for generating normal random variables, Comm. ACM, 7, 4–10.
Marsaglis, G., A. Zaman, and J. Marsaglia (1994) Rapid evaluation of the inverse of the normal distribution function, Statistics and Probability Letters, 19, 259–266.
Minh, D.L. (1988). Generating gamma variates, ACM Trans. on Math. Software, 14, 261–266.
Moro, B. (1995). The full Monte, Risk, 8, 57–58.
Ross, S. and Z. Schechner (1986). Simulation uses of the exponential distribution, Stochastic Programming, M. Lucertini, ed., in Lecture Notes in Control and Information Sciences, Springer-Verlag, New York, 76, 41–52.
Schmeiser, B.W., and A.J.G. Babu (1980). Beta variate generation via exponential majorizing functions, Oper. Res., 28, 917–926.
Schmeiser, B.W., and A.J.G. Babu (1980). Beta variate generation via exponential majorizing functions, Errata: Oper. Res., 31, 1983, 802.
Schmeiser, B.W., and R. Lal (1980). Squeeze methods for generating gamma variates, J. Amer. Statist. Assoc. 75, 679–682.
Schmeiser, B.W., and V. Kachitvichyanukul (1981). Poisson random variate generation, Res. Memo. 8184, School of Industrial Engineering, Purdue University.
Schreider, Y.A. (1964). Method of Statistical Testing, Elsevier, Amsterdam.
Schucany, W.R. (1972). Order statistics in simulation, J. Statist. Comput. and Simul., 1, 281–286.
Stadlober, E. (1982). Generating Student’s t variates by a modified rejection method, Probability and Statistical Inference, W. Grossmann, G.Ch. Plug, and W. Wertz, eds., Reidel, Dordrecht, Holland, 349–360.
Stadlober, E. (1989). Sampling from Poisson, binomial and hypergeometric distributions: ratio of uniforms as a simple and fast alternative, Math. Statist. Sektion 303, Forschungsgesellschaft Joanneum, Graz, Austria.
Stadlober, E. (1991). Binomial random variate generation: a method based on ratio of uniforms, The Frontiers of Statistical Computation, Simulation, and Modeling, volume 1; P.R. Nelson, E.J. Dudewicz, A. Öztürk, E.C. van der Meulen, editors, American Sciences Press, Syracuse, NY, 93–112.
von Neumann, J. (1951). Various techniques used in connection with random digits, Monte Carlo Method, Applied Mathematics Series 12, National Bureau of Standards, Washington, D.C.
Walker, A.J. (1974). New fast method for generating discrete random numbers with arbitrary frequency distributions, Electronic Letters, 10, 127–128.
Walker, A.J. (1977). An efficient method for generating discrete random variables with general distributions, ACM Trans. on Math. Software, 3, 253–256.
Wilks, S.S. (1962). Mathematical Statistics, Wiley, New York.
Wong, C.K. and M.C. Easton (1980). An efficient method for weighted sampling without replacement, SIAM J. of Comput., 9, 111–113.
Zechner, H., and E. Stadlober (1993). Generating Beta variates via patchwork rejection, Computing, 50, 1–18.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media New York
About this chapter
Cite this chapter
Fishman, G.S. (2001). Sampling from Probability Distributions. In: Discrete-Event Simulation. Springer Series in Operations Research. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-3552-9_8
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3552-9_8
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-2892-4
Online ISBN: 978-1-4757-3552-9
eBook Packages: Springer Book Archive