EconStor >
Humboldt-Universität zu Berlin >
CASE - Center for Applied Statistics and Economics, Humboldt-Universität Berlin >
Papers, CASE - Center for Applied Statistics and Economics, HU Berlin >

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10419/22195
  
Title:Random number generation PDF Logo
Authors:L'Ecuyer, Pierre
Issue Date:2004
Series/Report no.:Papers / Humboldt-Universität Berlin, Center for Applied Statistics and Economics (CASE) 2004,21
Abstract:The fields of probability and statistics are built over the abstract concepts of probability space and random variable. This has given rise to elegant and powerful mathematical theory, but exact implementation of these concepts on conventional computers seems impossible. In practice, random variables and other random objects are simulated by deterministic algorithms. The purpose of these algorithms is to produce sequences of numbers or objects whose behavior is very hard to distinguish from that of their ?truly random? counterparts, at least for the application of interest. Key requirements may differ depending on the context. For Monte Carlo methods, the main goal is to reproduce the statistical properties on which these methods are based, so that the Monte Carlo estimators behave as expected, whereas for gambling machines and cryptology, observing the sequence of output values for some time should provide no practical advantage for predicting the forthcoming numbers better than by just guessing at random.
Document Type:Working Paper
Appears in Collections:Papers, CASE - Center for Applied Statistics and Economics, HU Berlin

Files in This Item:
File Description SizeFormat
21_pl.pdf303.13 kBAdobe PDF
No. of Downloads: Counter Stats
Download bibliographical data as: BibTeX
Share on:http://hdl.handle.net/10419/22195

Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.