Fast Generation of Discrete Random Variables
AbstractWe describe two methods and provide C programs for generating discrete random variables with functions that are simple and fast, averaging ten times as fast as published methods and more than five times as fast as the fastest of those. We provide general procedures for implementing the two methods, as well as specific procedures for three of the most important discrete distributions: Poisson, binomial and hypergeometric.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by American Statistical Association in its journal Journal of Statistical Software.
Volume (Year): 11 ()
Issue (Month): i03 ()
Contact details of provider:
Web page: http://www.jstatsoft.org/
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- George Marsaglia, . "Xorshift RNGs," Journal of Statistical Software, American Statistical Association, vol. 8(i14).
- Shmerling, Efraim, 2013. "A range reduction method for generating discrete random variables," Statistics & Probability Letters, Elsevier, vol. 83(4), pages 1094-1099.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Christopher F. Baum).
If references are entirely missing, you can add them using this form.