Abstract
The distribution of points (r n,r n+s), n = 0, 1, 2,...whose coordinates are terms at distance s of the pseudorandom sequence generated by the Wichmann and Hill method is studied. It is known that for many congruential generators critical values of the distance s exist such that these points, far from being uniformly distributed, are concentrated on very few lines. An algorithm is described for computing the critical distances within the Wichmann-Hill sequence and the results obtained are compared with those of other linear congruential generators.
This is a preview of subscription content, access via your institution.
References
Ahrens, J., Dieter, U. and Grube, A. (1970) Pseudo-random numbers: a new proposal for the choice of multiplicators. Computing, 6, 121–138.
Beyer, W.A., Roof, R.B. and Williamson, D. (1971) The lattice structure of multiplicative congruential pseudo-random vectors. Mathematics of Computation, 25, 345–363.
Brown, M. and Solomon, H. (1979) On combining pseudorandom number generators. Annals of Statistics, 7, 691–695.
Cenacchi, G. and De Matteis, A. (1970) Pseudo-random numbers for comparative Monte Carlo calculations. Numerische Mathematik, 16, 11–15.
CRAY-1 and CRAY-X-MP Compuer Systems Library Reference Manual. SR-0014, Rev. H, Febrary 1984.
De Matteis, A. and Pagnutti, S. (1988) Parallelization of random number generators and long-range correlations. Numerische Mathematik, 53, 595–608.
De Matteis, A. and Pagutti, S. (1990) Long-range correlations in linear and non-linear random number generators. Parallel Computing, 14, 207–210.
De Matteis, A. and Pagnutti, S. (1992) Critical distances in pseudorandom sequences generated with composite moduli. International Journal of Computer Mathematics, 43, 189–196.
De Matteis, A., Eichenauer-Herrmann, J. and Grothe, H. (1992) Computation of critical distances within multiplicative congruential pseudorandom number sequences. Journal of Computational and Applied Mathematics, 39, 49–55.
Deng, L. Y. and George, E. O. (1990) Generation of uniform variates from several nearly uniformly distributed variables. Communications in Statistics, B19, 145–154.
Eichenauer-Herrmann, J. and Grothe, H. (1989) A remark on long-range correlations in multiplicative congruential pseudorandom number generators. Numerische Mathematik, 56, 609–611.
Hammersley, J. M. and Handscomb, D. C. (1964) Monte Carlo Methods, Methuen & Co., London.
Kalos, M. H. and Whitlock, P. A. (1986) Monte Carlo Methods, Vol 1. Wiley-Interscience, New York.
Knuth, D. E. (1981) The Art of Computer Programming, Vol. 2: Seminumerical Algorithms, 2nd edn. Addison-Wesley, Reading, MA.
Maclaren, N. M. (1989) The generation of multiple independent sequences of pseudorandom numbers. Applied Statistics, 38, 351–359.
Ripley, B. D. (1983) The lattice structure of pseudo-random number generators. Proceedings of the Royal Society of London Series A, 389, 197–204.
Vinogradov, I. M. (1954) Elements of Number Theory. Dover, New York.
Wichmann, B. A. and Hill, I. D. (1982) Algorithm AS 183—An efficient and portable psuedo-random number generator. Applied Statistics, 31, 188–190.
Zeisel, H. (1986) A remark on algorithm AS 183. An efficient and portable pseudo-random number generator. Applied Statistics, 35, 89.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
De Matteis, A., Pagnutti, S. Long-range correlation analysis of the Wichmann-Hill random number generator. Stat Comput 3, 67–70 (1993). https://doi.org/10.1007/BF00153065
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF00153065
Keywords
- Pseudorandom numbers
- compound congruential method
- Wichmann-Hill generator
- long-range correlations
- critical distances