The DOI matches its Crossref record; 50 of the 50 references it cites were found in a registry or an index.
Random numbers for simulation
Open accessAbstract
In the mind of the average computer user, the problem of generating uniform variates by computer has been solved long ago. After all, every computer :system offers one or more function(s) to do so. Many software products, like compilers, spreadsheets, statistical or numerical packages, etc. also offer their own. These functions supposedly return numbers that could be used, for all practical purposes, as if they were the values taken by independent random variables, with a uniform distribution between 0 and 1. Many people use them with faith and feel happy with the results. So, why bother? Other (less naive) people do not feel happy with the results and with good reasons. Despite renewed crusades, blatantly bad generators still abound, especially on microcomputers [55, 69, 85, 90, 100]. Other generators widely used on medium-sized computers are perhaps not so spectacularly bad, but still fail some theoretical and/or empirical statistical tests, and/or generate easily detectable regular patterns [56, 65]. Fortunately, many applications appear quite robust to these defects. But with the rapid increase in desktop computing power, increasingly sophisticated simulation studies are being performed that require more and more “random” numbers and whose results are more sensitive to the quality of the underlying generator [28, 40, 65, 90]. Sometimes, using a not-so-good generator can give totally misleading results. Perhaps this happens rarely, but can be disastrous in some cases. For that reason, researchers are still actively investigating ways of building generators. The main goal is to design more robust generators without having to pay too much in terms of portability, flexibility, and efficiency. In the following sections, we give a quick overview of the ongoing research. We focus mainly on efficient and recently proposed techniques for generating uniform pseudorandom numbers. Stochastic simulations typically transform such numbers to generate variates according to more complex distributions [13, 25]. Here, “uniform pseudorandom” means that the numbers behave from the outside as if they were the values of i.i.d. random variables, uniformly distributed over some finite set of symbols. This set of symbols is often a set of integers of the form {0, . . . , m - 1} and the symbols are usually transformed by some function into values between 0 and 1, to approximate the U(0, 1) distribution. Other tutorial-like references on uniform variate generation include [13, 23, 52, 54, 65, 84, 89].
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Simulation Modeling and Analysis.
Schervish, M. J., Law, A. M., & Kelton, W. D. (1983) · Journal of the American Statistical Association · doi:10.2307/2288169 · Cited by 8,697
The Art of Computer Programming
Whitesides, G. E. (1970) · Nuclear Science and Engineering · doi:10.13182/nse70-a19705 · Cited by 6,008
Non-Uniform Random Variate Generation
Devroye, L. (1986) · Springer eBooks · doi:10.1007/978-1-4613-8643-8 · Cited by 4,041
The Art of Computer Programming. Volume 2: Seminumerical Algorithms.
Taussky, O., & Knuth, D. E. (1970) · The American Mathematical Monthly · doi:10.2307/2317055 · Cited by 3,822
Ripley, B. D. (1987) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316726 · Cited by 2,241
How to construct random functions
Goldreich, O., Goldwasser, S., & Micali, S. (1986) · Journal of the ACM · doi:10.1145/6490.6503 · Cited by 2,115
Introduction to Finite Fields and their Applications
Lidl, R., & Niederreiter, H. (1994) · Cambridge University Press eBooks · doi:10.1017/cbo9781139172769 · Cited by 2,069
Bratley, P., Fox, B. L., & Schrage, L. E. (1987) · Springer eBooks · doi:10.1007/978-1-4419-8724-2 · Cited by 1,468
Random number generators: good ones are hard to find
Park, S. K., & Miller, K. W. (1988) · Communications of the ACM · doi:10.1145/63039.63042 · Cited by 1,262
A Simple Unpredictable Pseudo-Random Number Generator
Blum, L., Blum, M., & Shub, M. (1986) · SIAM Journal on Computing · doi:10.1137/0215025 · Cited by 1,036
Quasi-Monte Carlo methods and pseudo-random numbers
Niederreiter, H. (1978) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1978-14532-7 · Cited by 806
Algorithm 659: Implementing Sobol's quasirandom sequence generator
Bratley, P., & Fox, B. L. (1988) · ACM Transactions on Mathematical Software · doi:10.1145/42288.214372 · Cited by 754
Proceedings of the 30th IEEE symposium on Foundations of computer science
Galil, Z., & Blum, E. K. (1994) · Cited by 677
Algorithm AS 183: An Efficient and Portable Pseudo-Random Number Generator
Wichmann, B. A., & Hill, I. D. (1982) · Applied Statistics · doi:10.2307/2347988 · Cited by 618
Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
Chor, B., & Goldreich, O. (1988) · SIAM Journal on Computing · doi:10.1137/0217015 · Cited by 544
RANDOM NUMBERS FALL MAINLY IN THE PLANES
Marsaglia, G. (1968) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.61.1.25 · Cited by 521
A guide to simulation (2nd ed.)
Bratley, P., Fox, B. L., & Schrage, L. E. (1986) · Springer eBooks · Cited by 500
Efficient and portable combined random number generators
L'Ecuyer, P. (1988) · Communications of the ACM · doi:10.1145/62959.62969 · Cited by 494
Self-citationRandom numbers generated by linear recurrence modulo two
Tausworthe, R. C. (1965) · Mathematics of Computation · doi:10.1090/s0025-5718-1965-0184406-1 · Cited by 441
RSA and Rabin Functions: Certain Parts are as Hard as the Whole
Alexi, W., Chor, B., Goldreich, O., & Schnorr, C. P. (1988) · SIAM Journal on Computing · doi:10.1137/0217013 · Cited by 339
Toward a universal random number generator
Marsaglia, G., Zaman, A., & Wan Tsang, W. (1990) · Statistics & Probability Letters · doi:10.1016/0167-7152(90)90092-l · Cited by 315
Generalized Feedback Shift Register Pseudorandom Number Algorithm
Lewis, T. G., & Payne, W. H. (1973) · Journal of the ACM · doi:10.1145/321765.321777 · Cited by 312
Fishman, G. S., & Moore, III (1986) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0907002 · Cited by 205
A non-linear congruential pseudo random number generator
Eichenauer, J., & Lehn, J. (1986) · Statistische Hefte · doi:10.1007/bf02932576 · Cited by 149
Implementing a random number package with splitting facilities
L’Ecuyer, P., & Côté, S. (1991) · ACM Transactions on Mathematical Software · doi:10.1145/103147.103158 · Cited by 141
Self-citationMatrices and the structure of random number sequences
Marsaglia, G., & Tsay, L.-H. (1985) · Linear Algebra and its Applications · doi:10.1016/0024-3795(85)90192-2 · Cited by 118
Inferring sequences produced by pseudo-random number generators
Boyar, J. (1989) · Journal of the ACM · doi:10.1145/58562.59305 · Cited by 114
The k -distribution of generalized feedback shift register pseudorandom numbers
Fushimi, M., & Tezuka, S. (1983) · Communications of the ACM · doi:10.1145/358150.358159 · Cited by 97
Recent trends in random number and random vector generation
Niederreiter, H. (1991) · Annals of Operations Research · doi:10.1007/bf02204856 · Cited by 82
Parallelization of random number generators and long-range correlations
Matteis, A. D., & Pagnutti, S. (1988) · Numerische Mathematik · doi:10.1007/bf01397554 · Cited by 81
Secret linear congruential generators are not cryptographically secure
Stern, J. (1987) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1987.51 · Cited by 79
Fishman, G. S. (1990) · Mathematics of Computation · doi:10.1090/s0025-5718-1990-0993929-9 · Cited by 78
Random Walks Arising in Random Number Generation
Chung, F., Diaconis, P. W., & Graham, R. L. (1987) · The Annals of Probability · doi:10.1214/aop/1176992088 · Cited by 74
How to Calculate Shortest Vectors in a Lattice
Dieter, U. (1975) · Mathematics of Computation · doi:10.1090/s0025-5718-1975-0379386-6 · Cited by 73
Random number generators for MIMD parallel processors
Percus, O. E., & Kalos, M. H. (1989) · Journal of Parallel and Distributed Computing · doi:10.1016/0743-7315(89)90002-6 · Cited by 62
Two fast implementations of the “minimal standard” random number generator
Carta, D. F. (1990) · Communications of the ACM · doi:10.1145/76372.76379 · Cited by 48
Compound Random Number Generators
Collings, B. J. (1987) · Journal of the American Statistical Association · doi:10.1080/01621459.1987.10478457 · Cited by 43
Maximum-length sequences, cellular automata, and random numbers
Compagner, A., & Hoogland, A. (1987) · Journal of Computational Physics · doi:10.1016/0021-9991(87)90037-4 · Cited by 39
On Combining Pseudorandom Number Generators
Brown, M., & Solomon, H. (1979) · The Annals of Statistics · doi:10.1214/aos/1176344690 · Cited by 37
The Handbook of Random Number Generation and Testing with TESTRAND Computer Code
Muller, M. E., Dudewicz, E. J., & Ralley, T. G. (1983) · Technometrics · doi:10.1080/00401706.1983.10487860 · Cited by 35
A Statistical Analysis of Generalized Feedback Shift Register Pseudorandom Number Generators
Niederreiter, H. (1987) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0908084 · Cited by 34
Partitioning the Period of a Class of m -Sequences and Application to Pseudorandom Number Generation
Arvillias, A. C., & Maritsas, D. G. (1978) · Journal of the ACM · doi:10.1145/322092.322106 · Cited by 27
Structural Properties for Two Classes of Combined Random Number Generators
L’Ecuyer, P., & Tezuka, S. (1991) · Mathematics of Computation · doi:10.2307/2938714 · Cited by 23
Self-citationRandom number generation with the recursion Xt = Xt−3p ⊕ Xt−3q
Fushimi, M. (1990) · Journal of Computational and Applied Mathematics · doi:10.1016/0377-0427(90)90341-v · Cited by 21
Uses and abuses of statistical simulation
Ripley, B. D. (1988) · Mathematical Programming · doi:10.1007/bf01589392 · Cited by 17
On the Period Length of Pseudorandom Vector Sequences Generated by Matrix Generators
Eichenauer‐Herrmann, J., Grothe, H., & Lehn, J. (1989) · Mathematics of Computation · doi:10.1090/s0025-5718-1989-0946603-0 · Cited by 16
About polynomial-time “unpredictable” generators
L’Ecuyer, P., & Proulx, R. (1989) · Winter Simulation Conference · doi:10.1145/76738.76799 · Cited by 16
Self-citationThe handbook of random number generation and testing with testrand computer code
Dudewicz, E. J., & Ralley, T. G. (1981) · Cited by 8
Efficient Parallel Pseudorandom Number Generation
Reif, J. H., & Tygar, J. D. (1988) · SIAM Journal on Computing · doi:10.1137/0217024 · Cited by 6
About Polynomial-Ttime "Unpredictable" Generators
L'Ecuyer, P., & Proulx, R. (2005) · 1989 Winter Simulation Conference Proceedings · doi:10.1109/wsc.1989.718716 · Cited by 4
Self-citation
Cited by
Handbook of Monte Carlo Methods
Kroese, D. P., Taimre, T., & Botev, Z. I. (2011) · Wiley Series in Probability and Statistics · doi:10.1002/9781118014967 · Cited by 1,104
TestU01: A C library for empirical testing of random number generators
L'Ecuyer, P., & Simard, R. (2007) · ACM Transactions on Mathematical Software · doi:10.1145/1268776.1268777 · Cited by 1,014
Self-citationAn Object-Oriented Random-Number Package with Many Long Streams and Substreams
L'Ecuyer, P., Simard, R., Chen, E. J., & Kelton, W. D. (2002) · Operations Research · doi:10.1287/opre.50.6.1073.358 · Cited by 347
Self-citationUniform random number generation
L'Ecuyer, P. (1994) · Annals of Operations Research · doi:10.1007/bf02136827 · Cited by 279
Self-citationAlgorithm 806: SPRNG: a scalable library for pseudorandom number generation
Mascagni, M., & Srinivasan, A. (2000) · ACM Transactions on Mathematical Software · doi:10.1145/358407.358427 · Cited by 275
Metadata
- Authors
- L'Ecuyer, P.
- Venue
- Communications of the ACM
- Published
- 1990-10
- Volume
- 33
- Issue
- 10
- Pages
- 85-97
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2035743124
- Cited by
- 282
- References
- 50
- FWCI
- 13.34
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.