Handbook of Computational Statistics 2011
DOI: 10.1007/978-3-642-21551-3_3
|View full text |Cite
|
Sign up to set email alerts
|

Random Number Generation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
43
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 124 publications
(43 citation statements)
references
References 99 publications
0
43
0
Order By: Relevance
“…The resulting binary generator was used on the National Bureau of Standards Western Automatic Computer (SWAC). Interestingly, this combination principle to obtain long-period RNGs from shorter-period components has been rediscovered and reused in the RNG literature and is still used in some of the best RNGs currently available; see Wichmann and Hill (1982) and L'Ecuyer (1986, 1999a, 1999c, 2012, for example,…”
Section: Algorithmic Generatorsmentioning
confidence: 99%
See 1 more Smart Citation
“…The resulting binary generator was used on the National Bureau of Standards Western Automatic Computer (SWAC). Interestingly, this combination principle to obtain long-period RNGs from shorter-period components has been rediscovered and reused in the RNG literature and is still used in some of the best RNGs currently available; see Wichmann and Hill (1982) and L'Ecuyer (1986, 1999a, 1999c, 2012, for example,…”
Section: Algorithmic Generatorsmentioning
confidence: 99%
“…They also found an asymptotically random Tausworthe generator with period 2 607 − 1, based on the recurrence x i = (x i−607 + x i−273 ) mod 2, s = 512, and w = 23. Asymptotically random is also called maximally equidistributed (ME) in many articles and books; e.g., Tezuka (1995), L'Ecuyer (1996b), L'Ecuyer (2012, and is seen as a highly-desirable property. Lewis and Payne (1973) proposed a fast way to run a generalized version of a Tausworthe generator with two nonzero coefficients a k = a r = 1, by using a large circular array of bits of size w × k for the state, and called it a generalized feedback shift register (GFSR).…”
Section: Linear Recurrences Modulo a Large Primementioning
confidence: 99%
“…A high-quality PRNG is commonly defined as a generator that passes a number of numerical tests and is found suitable for intended uses (L'Ecuyer, 1988;Press and others, 1992;Hellekalek, 1998;L'Ecuyer, 1998. Statistical theory dictates that random numbers are independent and identically distributed, but PRNGs have several characteristics that are at odds with statistical theory.…”
Section: Generating Random Numbers From a Uniform Distributionmentioning
confidence: 99%
“…Most common methods for non-uniform RN generation are based on a first stage in which U[0, 1] samples are generated [6]. Let u i be a sample of the U[0, 1] distribution, X the target distribution and ICDF its Inverse Cumulative Distribution Function.…”
Section: Monte-carlo Simulationsmentioning
confidence: 99%
“…For each simulation path, stock prices are updated by using Equation (6) and accumulated in order to compute the mean value until the maturity time T . The payoff is evaluated as the profit involved in the transaction.…”
Section: Option Price Calculationmentioning
confidence: 99%