IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v55y2001i1p131-137.html
   My bibliography  Save this article

On the performance of birthday spacings tests with certain families of random number generators

Author

Listed:
  • L’Ecuyer, Pierre
  • Simard, Richard

Abstract

We examine how a statistical test based on discrete spacings between points, in one or more dimensions, detects the regularities in certain popular classes of random number generators. We provide a rule of thumb giving the minimal sample size for the test to reject the generator systematically, as a function of the generator’s size (or period length), for generator families such as the linear congruential, Taus worthe, non linear inversive, etc. Full period linear congruential generators with a good behavior in the spectral test, for example, start to fail the two-dimensional test decisively at sample sizes approximately equal to the cubic root of their period length (or modulus).

Suggested Citation

  • L’Ecuyer, Pierre & Simard, Richard, 2001. "On the performance of birthday spacings tests with certain families of random number generators," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 55(1), pages 131-137.
    • Handle: RePEc:eee:matcom:v:55:y:2001:i:1:p:131-137
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475400002536
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Pierre L'Ecuyer & Raymond Couture, 1997. "An Implementation of the Lattice and Spectral Tests for Multiple Recursive Linear Random Number Generators," INFORMS Journal on Computing, INFORMS, vol. 9(2), pages 206-217, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Aljahdali Asia & Mascagni Michael, 2017. "Feistel-inspired scrambling improves the quality of linear congruential generators," Monte Carlo Methods and Applications, De Gruyter, vol. 23(2), pages 89-99, June.
    2. Michael S. Delgado & Christopher F. Parmeter, 2013. "Embarrassingly Easy Embarrassingly Parallel Processing in R: Implementation and Reproducibility," Working Papers 2013-06, University of Miami, Department of Economics.
    3. L'Ecuyer, Pierre, 2004. "Random number generation," Papers 2004,21, Humboldt University of Berlin, Center for Applied Statistics and Economics (CASE).
    4. Pierre L’Ecuyer & Paul Wambergue & Erwan Bourceret, 2020. "Spectral Analysis of the MIXMAX Random Number Generators," INFORMS Journal on Computing, INFORMS, vol. 32(1), pages 135-144, January.
    5. Pierre L'Ecuyer & Richard Simard & E. Jack Chen & W. David Kelton, 2002. "An Object-Oriented Random-Number Package with Many Long Streams and Substreams," Operations Research, INFORMS, vol. 50(6), pages 1073-1075, December.
    6. L’Ecuyer, Pierre & Granger-Piché, Jacinthe, 2003. "Combined generators with components from different families," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 62(3), pages 395-404.
    7. Harase, Shin, 2019. "Conversion of Mersenne Twister to double-precision floating-point numbers," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 161(C), pages 76-83.
    8. Pierre L'Ecuyer & Richard Simard, 2014. "On the Lattice Structure of a Special Class of Multiple Recursive Random Number Generators," INFORMS Journal on Computing, INFORMS, vol. 26(3), pages 449-460, August.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Pierre L'Ecuyer & Christiane Lemieux, 2000. "Variance Reduction via Lattice Rules," Management Science, INFORMS, vol. 46(9), pages 1214-1235, September.
    2. Pierre L'Ecuyer & Richard Simard, 2014. "On the Lattice Structure of a Special Class of Multiple Recursive Random Number Generators," INFORMS Journal on Computing, INFORMS, vol. 26(3), pages 449-460, August.
    3. L'Ecuyer, Pierre & Andres, Terry H., 1997. "A random number generator based on the combination of four LCGs," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 44(1), pages 99-107.
    4. Hui-Chin Tang & Chiang Kao, 2004. "Searching for Good Multiple Recursive Random Number Generators via a Genetic Algorithm," INFORMS Journal on Computing, INFORMS, vol. 16(3), pages 284-290, August.
    5. L’Ecuyer, Pierre & Granger-Piché, Jacinthe, 2003. "Combined generators with components from different families," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 62(3), pages 395-404.
    6. Tang, Hui-Chin, 2005. "Reverse multiple recursive random number generators," European Journal of Operational Research, Elsevier, vol. 164(2), pages 402-405, July.
    7. L'Ecuyer, Pierre, 2004. "Random number generation," Papers 2004,21, Humboldt University of Berlin, Center for Applied Statistics and Economics (CASE).
    8. Pierre L’Ecuyer & Paul Wambergue & Erwan Bourceret, 2020. "Spectral Analysis of the MIXMAX Random Number Generators," INFORMS Journal on Computing, INFORMS, vol. 32(1), pages 135-144, January.
    9. Pierre L'Ecuyer, 1999. "Good Parameters and Implementations for Combined Multiple Recursive Random Number Generators," Operations Research, INFORMS, vol. 47(1), pages 159-164, February.
    10. Tang, Hui-Chin, 2006. "Theoretical analyses of forward and backward heuristics of multiple recursive random number generators," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1760-1768, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matcom:v:55:y:2001:i:1:p:131-137. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.