Skip to main content
Log in

Combining random number generators using cut and project sequences

  • Published:
Czechoslovak Journal of Physics Aims and scope

Abstract

This paper discusses the use of aperiodic (binary or ternary) sequences in combining pseudorandom number generators (RNG). We introduce a method for combining two or three RNGs using cut and project sequences. This combination method produces aperiodic number sequences having no lattice structure. Theoretical results are announced.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. B.A. Wichmann and I.D. Hill: J. Roy. Statist. Soc. Ser. C Appl. Statist.31 (1982) 188.

    Google Scholar 

  2. P. L’Écuyer: Commun. ACM31 (1988) 742, 774.

    Article  Google Scholar 

  3. P. L’Écuyer and S. Tezuka: Math. Comp.57 (1991) 735.

    Article  MATH  MathSciNet  Google Scholar 

  4. P. L’Écuyer and T.H. Andres: Math. Comput. Simulation44 (1997) 99.

    Article  MATH  MathSciNet  Google Scholar 

  5. L.-Y. Deng, D.K.J. Lin, and Y. Yuan: Statistica Sinica7 (1997) 993.

    MATH  MathSciNet  Google Scholar 

  6. P. L’Écuyer: Operation Res.44 (1996) 816.

    MATH  Google Scholar 

  7. P. L’Écuyer: Commun. ACM33 (1990) 85.

    Article  Google Scholar 

  8. H. Niederreiter:SIAM CBMS-NSF Regional Conf. Ser. in Applied Mathematics, Vol. 63, SIAM, Philadelphia (USA), 1992.

    Google Scholar 

  9. R. Zieliński: J. Comput. Appl. Math.31 (1990) 205.

    Article  MathSciNet  MATH  Google Scholar 

  10. H. Sugita: Monte Carlo Methods Appl.1 (1995) 35.

    Article  MATH  MathSciNet  Google Scholar 

  11. M. Andrecut: Int J. Mod. Phys. B12 (1998) 921.

    Article  ADS  MathSciNet  Google Scholar 

  12. N.B. Slater: Proc. Camb. Philos. Soc.73 (1967) 1115.

    Article  MathSciNet  Google Scholar 

  13. R. Zieliński: Statist. Probab. Lett.4 (1986) 259.

    Article  MathSciNet  Google Scholar 

  14. Z. Masáková, J. Patera, and E. Pelantová: J. Phys. A: Math. Gen.33 (2000) 8867.

    Article  MATH  ADS  Google Scholar 

  15. Z. Masáková, J. Patera, and E. Pelantová: inProc. of Quantum Theory and Symmetries (Eds. H.-D. Doebner, V.K. Dobrev, J.-D. Hennig, and W. Luecke), World Scientific, Singapore, 2000, p. 499.

    Google Scholar 

  16. L.-S. Guimond, Jan Patera, and Jiří Patera:Statistics and implementation of an APRNG, submitted to Appl. Num. Comp. (2001).

  17. G. Marsaglia:Diehard, Web page: http://stat.fsu.edu/~geo/diehard.html.

  18. L.-S. Guimond and J. Patera: to appear in Math. Comp. (2001).

  19. Jan Patera:Generating the Fibonacci chain in O(logn) space and O(n) time, preprint (2001).

Download references

Author information

Authors and Affiliations

Authors

Additional information

This work was partially supported by the Bell Canada University Laboratory, NSERC of Canada and FCAR of Québec.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Guimond, LS., Patera, J. & Patera, J. Combining random number generators using cut and project sequences. Czech J Phys 51, 305–311 (2001). https://doi.org/10.1023/A:1017533304855

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1017533304855

Keywords

Navigation