Skip to main content

On the Deng-Lin random number generators and related methods

Abstract

We study the structure and point out weaknesses of recently proposed random number generators based on special types of linear recurrences with small coefficients, which allow fast implementations. Our theoretical analysis is complemented by the results of simple empirical statistical tests that the generators fail decisively. Directions for improvement and alternative generators are also pointed out.

This is a preview of subscription content, access via your institution.

References

  • Conway J.H. and Sloane N.J.A. 1999. Sphere Packings, Lattices and Groups. 3rd ed. Grundlehren der Mathematischen Wissenschaften 290. New York: Springer-Verlag.

    Google Scholar 

  • Deng L.-Y. and Lin D.K.J. 2000. Random number generation for the new century. The American Statistician 54(2): 145-150.

    Google Scholar 

  • Deng L.-Y. and Xu H. 2002. Design, search, and implementation of high-dimensional, efficient, long-cycle, and portable uniform random variate generator. Technical report, Department of Statistics, University of California at Los Angeles. Preprint #327.

  • Grube A. 1973. Mehrfach rekursiv-erzeugte Pseudo-Zufallszahlen. Zeitschrift für angewandte Mathematik und Mechanik 53: T223-T225.

    Google Scholar 

  • Knuth D.E. 1998. The Art of Computer Programming, Vol. 2: Seminumerical Algorithms. 3rd ed. Reading, Mass.; Addison-Wesley.

    Google Scholar 

  • L'Ecuyer P. 1996. Combined multiple recursive random number generators. Operations Research 44(5): 816-822.

    Google Scholar 

  • L'Ecuyer P. 1997. Bad lattice structures for vectors of non-successive values produced by some linear recurrences. INFORMS Journal on Computing 9(1): 57-60.

    Google Scholar 

  • L'Ecuyer P. 1999a. Good parameters and implementations for combined multiple recursive random number generators. Operations Research 47(1): 159-164.

  • L'Ecuyer P. 1999b. Tables of linear congruential generators of different sizes and good lattice structure. Mathematics of Computation 68(225): 249-260.

  • L'Ecuyer P. 1999c. Tables of maximally equidistributed combinedLFSR generators. Mathematics of Computation 68(225): 261-269.

  • L'Ecuyer P., Blouin F., and Couture R. 1993. A search for good multiple recursive random number generators. ACM Transactions on Modeling and Computer Simulation 3(2): 87-98.

    Google Scholar 

  • L'Ecuyer P. and Couture R. 1997. An implementation of the lattice and spectral tests for multiple recursive linear random number generators. INFORMS Journal on Computing 9(2): 206-217.

    Google Scholar 

  • L'Ecuyer P. and Simard R. 2001. On the performance of birthday spacings tests for certain families of random number generators. Mathematics and Computers in Simulation 55(1-3): 131-137.

    Google Scholar 

  • L'Ecuyer P. and Touzin R. 2000. Fast combined multiple recursive generators with multipliers of the form a =±2q ±2r. In: Joines J.A., Barton R.R., Kang K., and Fishwick P.A. (Eds.), Proceedings of the 2000 Winter Simulation Conference, Pistacaway, NJ, IEEE Press, pp. 683-689.

  • Marsaglia G. 1996. The Marsaglia random number CDROM including the DIEHARD battery of tests of randomness. See http://stat.fsu.edu/pub/diehard.

  • Matsumoto M. and Nishimura T. 1998. Mersenne twister: A 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Transactions on Modeling and Computer Simulation 8(1): 3-30.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and Permissions

About this article

Cite this article

L'Ecuyer, P., Touzin, R. On the Deng-Lin random number generators and related methods. Statistics and Computing 14, 5–9 (2004). https://doi.org/10.1023/B:STCO.0000009417.88960.81

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:STCO.0000009417.88960.81

  • multiple recursive generator (MRG)
  • lattice structure
  • efficient generator
  • statistical test of randomness