The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
An Exhaustive Analysis of Multiplicative Congruential Random Number Generators with Modulus $2^{31} - 1$
Abstract
This paper presents the results of an exhaustive search to find optimal full period multipliers for the multiplicative congruential random number generator with prime modulus $2^{31} - 1$. Here a multiplier is said to be optimal if the distance between adjacent parallel hyperplanes on which k-tuples lie does not exceed the minimal achievable distance by more than 25 percent for $k = 2, \cdots ,6$. This criterion is considerably more stringent than prevailing standards of acceptability and leads to a total of only 414 multipliers among the more than 534 million candidate multipliers. Section 1 reviews the basic properties of linear congruential generators and § 2 describes worst case performance measures. These include the maximal distance between adjacent parallel hyperplanes, the minimal number of parallel hyperplanes, the minimal distance between k-tuples, the lattice ratio and the discrepancy. Section 3 presents the five best multipliers and compares their performances with those of three commonly employed multipliers for all measures but the lattice test. Comparisons using packing measures in the space of k-tuples and in the dual space are also made. Section 4 presents the results of applying a battery of statistical tests to the best five to detect local departures from randomness. None were found. The Appendix contains a list of all optimal multipliers.
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
Asymptotic Theory of Certain "Goodness of Fit" Criteria Based on Stochastic Processes
Anderson, T. W., & Darling, D. A. (1952) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729437 · Cited by 3,542
Anderson, T. W., & Darling, D. A. (1954) · Journal of the American Statistical Association · doi:10.1080/01621459.1954.10501232 · Cited by 2,450
Cited by
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
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
Monte Carlo and Quasi-Monte Carlo Sampling
(2009) · Springer Series in Statistics · doi:10.1007/978-0-387-78165-5 · Cited by 497
Efficient and portable combined random number generators
L'Ecuyer, P. (1988) · Communications of the ACM · doi:10.1145/62959.62969 · Cited by 494
Stochastic volatility in asset prices estimation with simulated maximum likelihood
Danielsson, J. (1994) · Journal of Econometrics · doi:10.1016/0304-4076(94)90070-1 · Cited by 393
Deterministic and Stochastic Error Bounds in Numerical Analysis
Novak, E. (1988) · Lecture Notes in Mathematics · doi:10.1007/bfb0079792 · Cited by 361
Implementation of the three‐dimensional turning bands random field generator
Tompson, A. F. B., Ababou, R., & Gelhar, L. W. (1989) · Water Resources Research · doi:10.1029/wr025i010p02227 · Cited by 361
L'Ecuyer, P. (1990) · Communications of the ACM · doi:10.1145/84537.84555 · Cited by 282
Uniform random number generation
L'Ecuyer, P. (1994) · Annals of Operations Research · doi:10.1007/bf02136827 · Cited by 279
Recent Advances in Randomized Quasi-Monte Carlo Methods
L’Ecuyer, P., & Lemieux, C. (2002) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48102-2_20 · Cited by 254
Graphics and managerial decision making: research-based guidelines
Jarvenpaa, S. L., & Dickson, G. W. (1988) · Communications of the ACM · doi:10.1145/62959.62971 · Cited by 253
Bad subsequences of well-known linear congruential pseudorandom number generators
Entacher, K. (1998) · ACM Transactions on Modeling and Computer Simulation · doi:10.1145/272991.273009 · Cited by 51
Sparse serial tests of uniformity for random number generators
L'Ecuyer, P., Simard, R., & Wegenkittl, S. (2002) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827598349033 · Cited by 50
Metadata
- Authors
- Fishman, G. S., & Moore, III
- Venue
- SIAM Journal on Scientific and Statistical Computing
- Published
- 1986-01
- Volume
- 7
- Issue
- 1
- Pages
- 24-45
- ISSN
- 0196-5204 (ISSN-L)
- 2168-3417
- OpenAlex
- W2022349318
- Cited by
- 205
- References
- 2
- FWCI
- 8.39
- Type
- journal article
- Language
- en
- Open access
- closed
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.