Hostname: page-component-cd4964975-598jt Total loading time: 0 Render date: 2023-03-28T13:26:15.193Z Has data issue: true Feature Flags: { "useRatesEcommerce": false } hasContentIssue true

# 11 - Generating Random Variables from Other Distributions

Published online by Cambridge University Press:  01 June 2011

## Summary

Introduction

Chapter 10 provided an overview of Monte Carlo methods and dealt solely with the problem of generating from the uniform distribution. Since the uniform distribution is the fundamental distribution, we're now prepared to deal with the postponed problem of generating from other distributions. Given the results of Chapter 10, this problem should be viewed as transforming a source sequence of IID uniform random variables {Ui} to an IID sequence of random variables {Xi} with cumulative distribution function (cdf) F. A discussion of general methods for generating from continuous distributions forms Section 11.2. Specific algorithms designed for various distributions, such as the normal and Student's t, follow in Section 11.3. General methods for discrete distributions are discussed in Section 11.4, with specific cases in Section 11.5. Special problems, including random sampling from a population, are handled in Section 11.6. The problem of accuracy in Monte Carlo is tackled in Section 11.7.

Some general remarks are in order before pursuing the problem at hand. Algorithms for generating random variables should always be simple, fast, and exact. Simplicity is paramount, since users must often code and debug their own programs. Finding errors in random output is very difficult (see Exercises 11.14 and 11.20). If an algorithm is simple, most mistakes will bring consequences so severe that the error can be easily discovered. Speed is not so important, since the computational effort in generation is usually only a small fraction of the total effort in the Monte Carlo experiment.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2011

## 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.)

### Purchase

Buy print or eBook[Opens in a new window]

## References

, , and (1979), “Exact Conditional Tests for Cross-Classifications: Approximation of Attained Significance Levels,” Psychometrika 44: 75–83.CrossRefGoogle Scholar
and (1974), “Computer Methods for Sampling from Gamma, Beta, Poisson, and Normal Distributions,” Computing 12: 223–46.CrossRefGoogle Scholar
and (1991), “A Convenient Sampling Method with Bounded Computation Times for Poisson Distributions,” in (Ed.), The Frontiers of Statistical Computation, Simulation and Modeling, pp. 137–49. Columbus, OH: American Sciences Press.Google Scholar
(1933), “On the Theory of Statistical Regression,” Proceedings of the Royal Society of Edinburgh 53: 260–83.CrossRefGoogle Scholar
and (1958), “A Note on the Generation of Random Normal Deviates,” Annals of Mathematical Statistics 29: 610–11.CrossRefGoogle Scholar
, , and (1983), A Guide to Simulation. Berlin: Springer-Verlag.CrossRefGoogle Scholar
(1970), Optimal Statistical Decisions. New York: McGraw-Hill.Google Scholar
(1986), Non-Uniform Random Variate Generation. New York: Springer-Verlag.CrossRefGoogle Scholar
(1972), “Von Neumann's Comparison Method for Random Sampling from Normal and Other Distributions,” Mathematics of Computation 26: 817–26.Google Scholar
and (1977), “Computer Generation of Random Variables Using the Ratio of Uniform Deviates,” ACM Transactions on Mathematical Software 3: 257–60.CrossRefGoogle Scholar
and (1980), “New Methods for Generating Student's t and Gamma Variables,” Computing 25: 369–77.CrossRefGoogle Scholar
, , and (1977), “Computer Methods for Sampling from Student's t Distribution,” Mathematics of Computation 31: 1009–18.Google Scholar
and , (1979), “On the Alias Method for Generating Random Variables from a Discrete Distribution,” American Statistician 33: 214–18.Google Scholar
(1969), “An Extremely Portable Random Number Generator,” Communications of the ACM 12: 93–4.CrossRefGoogle Scholar
(1992), “A Fast Normal Random Number Generator,” ACM Transactions on Mathematical Software 18: 449–53.CrossRefGoogle Scholar
(1961), “Generating Exponential Random Variables,” Annals of Mathematical Statistics 32: 899–902.CrossRefGoogle Scholar
and (1964), “A Convenient Method for Generating Normal Variables,” SIAM Review 6: 260–4.CrossRefGoogle Scholar
(1979), “Extensions of von Neumann's Method for Generating Random Variables,” Mathematics of Computation 33: 1065–9.Google Scholar
(1985), “Accuracy in Random Number Generation,” Mathematics of Computation 45: 559–68.CrossRefGoogle Scholar
(1987), “An Algorithm for Generating Chi Random Variables,” ACM Transactions on Mathematical Software 13: 168–72.CrossRefGoogle Scholar
(1973), “On Using the Box–Muller Transformation with Multiplicative Congruential Pseudo-random Number Generators,” Applied Statistics 22: 92–7.CrossRefGoogle Scholar
(1971), Linear Models. New York: Wiley.Google Scholar
(1962), “Exponential and Other Random Variable Generators,” Annals of the Institute of Statistical Mathematics 13: 231–7.CrossRefGoogle Scholar
and (1972), “Algorithm AS 53: Wishart Variate Generator,” Applied Statistics 21: 341–5.CrossRefGoogle Scholar
(1989), “Sampling from Poisson, Binomial and Hypergeometric Distributions: Ratio of Uniforms as a Simple and Fast Alternative,”Mathematisch–Statistische Sektion 303. Forschungsgesellschaft Joanneum, Graz, Austria.Google Scholar
(1990), “The Ratio of Uniforms Approach for Generating Discrete Random Variables,” Journal of Computational and Applied Mathematics 31: 181–9.CrossRefGoogle Scholar
(1991), “Binomial Random Variate Generation: A Method Based on Ratio of Uniforms,” in (Ed.), The Frontiers of Statistical Computation, Simulation and Modeling, pp. 93–112. Columbus, OH: American Sciences Press.Google Scholar
(1987), “An Efficient Algorithm for Sequential Random Sampling,” ACM Transactions on Mathematical Software 13: 58–67.CrossRefGoogle Scholar
(1951), “Various Techniques in Connection with Random Digits,” in Monte Carlo|Method (AMS 12), pp. 36–8. Washington, DC: National Bureau of Standards.Google Scholar
(1977), “An Efficient Method for Generating Random Variables with General Distributions,” ACM Transactions on Mathematical Software 3: 253–6.CrossRefGoogle Scholar

# Save book to Kindle

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

# Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

# Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×