Multiply schemes and shuffling
HTML articles powered by AMS MathViewer
- by M. Rosenblatt PDF
- Math. Comp. 29 (1975), 929-934 Request permission
Abstract:
Multiply schemes are used as a model of a linear congruential scheme. It is suggested how the properties of linear congruential schemes as pseudo-random number generators might be improved by shuffling. Asymptotic frequencies of pairs and triples from multiply schemes are obtained.References
- Joel N. Franklin, Deterministic simulation of random processes, Math. Comp. 17 (1963), 28–59. MR 149640, DOI 10.1090/S0025-5718-1963-0149640-3
- Donald E. Knuth, The art of computer programming. Vol. 2: Seminumerical algorithms, Addison-Wesley Publishing Co., Reading, Mass.-London-Don Mills, Ont., 1969. MR 0286318 G. P. LEARMONTH & P. A. W. LEWIS, Statistical Test of Some Widely Used and Recently Proposed Uniform Random Number Generators, Proc. Conf. on Comput. Sci. and Statistics, Western Periodicals Co., North Hollywood, Calif., 1973, pp. 163-171.
- George Marsaglia and T. A. Bray, One-line random number generators and their use in combinations, Comm. ACM 11 (1968), 757–759. MR 0243719, DOI 10.1145/364139.364158
Additional Information
- © Copyright 1975 American Mathematical Society
- Journal: Math. Comp. 29 (1975), 929-934
- MSC: Primary 65C10
- DOI: https://doi.org/10.1090/S0025-5718-1975-0381231-X
- MathSciNet review: 0381231