Skip to main content
SpringerLink
Log in

Distribution of Lattice Points

  • Published:
Computing Aims and scope Submit manuscript

Abstract

We discuss the lattice structure of congruential random number generators and examine figures of merit. Distribution properties of lattice measures in various dimensions are demonstrated by using large numerical data. Systematic search methods are introduced to diagnose multiplier areas exhibiting good, bad and worst lattice structures. We present two formulae to express multipliers producing worst and bad laice points. The conventional criterion of normalised lattice rule is also questioned and it is shown that this measure used with a fixed threshold is not suitable for an effective discrimination of lattice structures. Usage of percentiles represents different dimensions in a fair fashion and provides consistency for different figures of merits.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • L. Afflerbach (1990) ArticleTitleCriteria for the assessment off random number generators J. Comp. Appl. Math. 31 3–10 Occurrence Handle0703.65006 Occurrence Handle1068144 Occurrence Handle10.1016/0377-0427(90)90330-3

    Article  MATH  MathSciNet  Google Scholar 

  • Coddington, P. D., Ko, S. H.: Techniques for empirical testing of parallel random number generators. Technical Report DHPC-025. New York: Syracuse University 1998.

  • J. H. Conway N. J. A. Sloan (1988) Sphere packings, lattices and groups. Grundlehren der Mathematischen Wissenschaften 290 Springer New York

    Google Scholar 

  • I. G. Dyadkin K. G. Hamilton (1997) ArticleTitleA study of 64-bit multipliers for Lehmer pseudorandom number generators Comput. Phys. Commun. 103 103–130 Occurrence Handle0980.65007 Occurrence Handle1470096 Occurrence Handle10.1016/S0010-4655(97)00052-0

    Article  MATH  MathSciNet  Google Scholar 

  • I. G. Dyadkin K. G. Hamilton (2000) ArticleTitleA study of 128-bit multipliers for congruential pseudorandom number generators Comput. Phys. Commun. 125 239–258 Occurrence Handle0980.65008 Occurrence Handle10.1016/S0010-4655(99)00467-1

    Article  MATH  Google Scholar 

  • Entacher, K.: A collection of classical pseudorandom number generators with linear structures – advanced version. http://crypto.mat.sbg.ac.at/results/karl/server/ June 16, 2000.

  • K. Entacher T. Schell A. Uhl (2002) ArticleTitleEfficient lattice assessment for LCG and GLP parameter searches Math. Comp. 71 1231–1242 Occurrence Handle1029.11041 Occurrence Handle1898753 Occurrence Handle10.1090/S0025-5718-01-01415-6

    Article  MATH  MathSciNet  Google Scholar 

  • K. Entacher T. Schell A. Uhl (2005) ArticleTitleBad lattice points Computing 75 281–295 Occurrence Handle1115.11048 Occurrence Handle2173514 Occurrence Handle10.1007/s00607-004-0105-z

    Article  MATH  MathSciNet  Google Scholar 

  • A. M. Ferrenberg D. P. Landau Y. J. Wong (1992) ArticleTitleMonte Carlo simulations: Hidden errors from “good” random number generators Phys. Rev. Lett. 69 3382–3374 Occurrence Handle10.1103/PhysRevLett.69.3382

    Article  Google Scholar 

  • T. Filk M. Marcu K. Fredenhagen (1985) ArticleTitleLong range correlations in random number generators and their influence on Monte Carlo simulations Phys. Lett. 165B IssueID1–3 125–130

    Google Scholar 

  • G. S. Fishman (1990) ArticleTitleMultiplicative congruential random number generators with modulus 2β: An exhaustive analysis for β = 32 and a partial analysis for β = 48 Math. Comp. 54 331–344 Occurrence Handle0686.65004 Occurrence Handle993929 Occurrence Handle10.2307/2008698

    Article  MATH  MathSciNet  Google Scholar 

  • G. S. Fishman (1996) Monte Carlo concepts, algorithms, and applications Springer New York Occurrence Handle0859.65001

    MATH  Google Scholar 

  • G. Fishman L. R. Moore (1986) ArticleTitleAn exhaustive analysis of multiplicative congruential random number generators with modulus 231–1 SIAM J. Sci. Stat. Comput. 7 24–45 Occurrence Handle0603.65003 Occurrence Handle819455 Occurrence Handle10.1137/0907002

    Article  MATH  MathSciNet  Google Scholar 

  • C. Kao H. C. Tang (1998) ArticleTitleSeveral extensively tested multiple recursive random number generators Comput. Math. Appl. 36 129–136 Occurrence Handle0932.65004 Occurrence Handle1645380 Occurrence Handle10.1016/S0898-1221(98)00166-7

    Article  MATH  MathSciNet  Google Scholar 

  • C. Kao H. C. Tang (1997) ArticleTitleUpper bounds in spectral test for multiple recursive random number generators with missing terms Comput. Math. Appl. 33 119–125 Occurrence Handle0879.65001 Occurrence Handle1433464 Occurrence Handle10.1016/S0898-1221(97)00012-6

    Article  MATH  MathSciNet  Google Scholar 

  • C. Kao J. Y. Wong (1994) ArticleTitleSeveral extensively tested random number generators Comput. Ops. Res. 21 1035–1039 Occurrence Handle0862.65003 Occurrence Handle10.1016/0305-0548(94)90074-4

    Article  MATH  Google Scholar 

  • C. Kao J. Y. Wong (1996) ArticleTitleAn exhaustive analysis of prime modulus multiplicative congruential random number generators with modulus smaller than 215 J. Statist. Comp. Simul. 54 29–35 Occurrence Handle0884.65004 Occurrence Handle1700917

    MATH  MathSciNet  Google Scholar 

  • C. Kao J.Y. Wong (1998) ArticleTitleRandom number generators with long period and sound statistical properties Comput. Math. Appl. 36 113–121 Occurrence Handle0932.65003 Occurrence Handle1632348 Occurrence Handle10.1016/S0898-1221(98)00133-3

    Article  MATH  MathSciNet  Google Scholar 

  • D. E. Knuth (1998) The art of computer programming, vol. 2: Seminumerical algorithms, 3rd ed. Reading Addison-Wesley MA

    Google Scholar 

  • Y. Kurita (1997) Choosing parameters for congruential random number generators J. R. Barra (Eds) et al. Recent developments in statistics North Holland Amsterdam 697–704

    Google Scholar 

  • P. L'Ecuyer (1990) ArticleTitleRandom numbers for simulation Commun. ACM. 33 86–97 Occurrence Handle10.1145/84537.84555

    Article  Google Scholar 

  • P. L'Ecuyer (1999) ArticleTitleTables of linear congruential generators of different sizes and good lattice structure Math. Comp. 68 249–260 Occurrence Handle0917.65002 Occurrence Handle1489972 Occurrence Handle10.1090/S0025-5718-99-00996-5

    Article  MATH  MathSciNet  Google Scholar 

  • P. L'Ecuyer F. Blouin R. Couture (1993) ArticleTitleA search for good multiple recursive random number generators ACM Trans. Model. Comput. Simulation 3 87–98 Occurrence Handle0842.65004 Occurrence Handle10.1145/169702.169698

    Article  MATH  Google Scholar 

  • P. L'Ecuyer R. Couture (1997) ArticleTitleAn implementation of the lattice and spectral tests for multiple recursive linear random number generators INFORMS J. Comput. 9 206–217 Occurrence Handle0889.65004 Occurrence Handle1477315 Occurrence Handle10.1287/ijoc.9.2.206

    Article  MATH  MathSciNet  Google Scholar 

  • L'Ecuyer, P., Hellekalek, P.: Random number generators: Selection criteria and testing. In: Random and Quasi-random Point Sets (Hellekalek, P. and Larcher G., eds.). Lectures Notes in Statistics, vol. 138. Springer 1998, pp. 223–266.

  • P. L'Ecuyer S. Tezuka (1991) ArticleTitleStructural properties for two classes of combined random number generator Math. Comp. 57 735–746 Occurrence Handle0748.65007 Occurrence Handle1094954 Occurrence Handle10.2307/2938714

    Article  MATH  MathSciNet  Google Scholar 

  • Leeb, H.: Random numbers for computer simulation. Master's thesis, Institute für Mathematik, Universität Salzburg, Austria, 1995. Available from: http://random.mat.sbg.ac.at/.

  • C. Lemieux P. L'Ecuyer (2001) ArticleTitleOn selection criteria for lattice rules and other quasi–Monte Carlo point sets Math. Comput. Simulation 55 139–148 Occurrence Handle0981.65007 Occurrence Handle1823111 Occurrence Handle10.1016/S0378-4754(00)00254-8

    Article  MATH  MathSciNet  Google Scholar 

  • Niederreiter, H.: Random number generation and quasi–Monte Carlo methods. Society for Industrial and Applied Mathematics, Philadelphia, PA 1992.

  • B.D. Ripley (1987) Stochastic simulation Wiley New York Occurrence Handle0613.65006

    MATH  Google Scholar 

  • F. Sezgin (1996) ArticleTitleSome improvements for a random number generator with single-precision floating-point arithmetic Comput. Geosci. 22 IssueID4 453–455 Occurrence Handle10.1016/0098-3004(95)00107-7

    Article  Google Scholar 

  • F. Sezgin (2004) ArticleTitleA method of systematic search for optimal multipliers in congruential random number generators BIT Numer. Math. 44 135–149 Occurrence Handle1048.65003 Occurrence Handle2057366 Occurrence Handle10.1023/B:BITN.0000025085.88778.75

    Article  MATH  MathSciNet  Google Scholar 

  • H. C. Tang (2005) ArticleTitleModulus of linear congruential random number generator Quality Quantity 39 413–422 Occurrence Handle10.1007/s11135-004-6788-6

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Bilkent University, 06580, Ankara, Turkey

    F. Sezgin

Authors
  1. F. Sezgin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to F. Sezgin.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sezgin, F. Distribution of Lattice Points. Computing 78, 173–193 (2006). https://doi.org/10.1007/s00607-006-0173-3

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00607-006-0173-3

AMS Subject Classifications

Keywords

Search

Navigation