Abstract
Many random variables can be approximated quite closely by c(M + U1 + U2 + U3), where c is constant, M is a discrete random variable, and the U's are uniform random variables. Such a representation appears attractive as a method for generating variates in a computer, since M + U1 + U2 + U3 can be quickly and simply generated. A typical application of this idea will have M taking from 4 to 7 values; the required X will be produced in the form c(M + U1 + U2 + U3) perhaps 95--99% of the time, and occasionally by the rejection technique, to make the resulting distribution come out right. This paper describes the method and gives examples of how to generate beta, normal, and chi-square variates.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
