A general method for producing random variables in a computer

G. Marsaglia
{"title":"A general method for producing random variables in a computer","authors":"G. Marsaglia","doi":"10.1145/1464291.1464310","DOIUrl":null,"url":null,"abstract":"Many random variables can be approximated quite closely by <i>c</i>(<i>M</i> + <i>U</i><sub>1</sub> + <i>U</i><sub>2</sub> + <i>U</i><sub>3</sub>), where <i>c</i> is constant, <i>M</i> is a discrete random variable, and the <i>U</i>'s are uniform random variables. Such a representation appears attractive as a method for generating variates in a computer, since <i>M</i> + <i>U</i><sub>1</sub> + <i>U</i><sub>2</sub> + <i>U</i><sub>3</sub> can be quickly and simply generated. A typical application of this idea will have <i>M</i> taking from 4 to 7 values; the required <i>X</i> will be produced in the form <i>c</i>(<i>M</i> + <i>U</i><sub>1</sub> + <i>U</i><sub>2</sub> + <i>U</i><sub>3</sub>) 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.","PeriodicalId":297471,"journal":{"name":"AFIPS '66 (Fall)","volume":"214 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1966-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"AFIPS '66 (Fall)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1464291.1464310","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
在计算机中产生随机变量的一般方法
许多随机变量可以用c(M + U1 + U2 + U3)近似表示,其中c是常数,M是离散随机变量,U是均匀随机变量。这种表示作为在计算机中生成变量的方法似乎很有吸引力,因为M + U1 + U2 + U3可以快速而简单地生成。这个想法的典型应用是M取4到7个值;所需的X可能在95% -99%的情况下以c(M + U1 + U2 + U3)的形式产生,偶尔通过抑制技术,使结果分布正确。本文描述了该方法,并给出了如何生成beta、正态和卡方变量的示例。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Automated logic design techniques applicable to integrated circuitry technology A conversational system for incremental compilation and execution in a time-sharing environment A system for Automatic Value Exchange (SAVE) The SDS SIGMA 7: a real-time time-sharing computer The Lincoln Reckoner: an operation-oriented, on-line facility with distributed control
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1