Random Number Generation

The fields of probability and statistics are built over the abstract concepts of probability space and random variable. This has given rise to elegant and powerful mathematical theory, but exact implementation of these concepts on conventional computers seems impossible. In practice, random variables and other random objects are simulated by deterministic algorithms. The purpose of these algorithms is to produce sequences of numbers or objects whose behavior is very hard to distinguish from that of their “truly random” counterparts, at least for the application of interest. Key requirements may differ depending on the context.For Monte Carlo methods, the main goal is to reproduce the statistical properties on which these methods are based, so that the Monte Carlo estimators behave as expected, whereas for gambling machines and cryptology, observing the sequence of output values for some time should provide no practical advantage for predicting the forthcoming numbers better than by just guessing at random.

[1]  R. Tausworthe.  Random Numbers Generated by Linear Recurrence Modulo Two , 1965 .

[2]  J. P. R. Tootill,et al.  An Asymptotically Random Tausworthe Sequence , 1973, JACM.

[3]  Huifen Chen,et al.  On Generating Random Variates from an Empirical Distribution , 1974 .

[4]  A. J. Walker.  New fast method for generating discrete random numbers with arbitrary frequency distributions , 1974 .

[5]  Albert J. Kinderman,et al.  Computer Generation of Random Variables Using the Ratio of Uniform Deviates , 1977, TOMS.

[6]  Alastair J. Walker,et al.  An Efficient Method for Generating Discrete Random Variables with General Distributions , 1977, TOMS.

[7]  H. Solomon,et al.  On Combining Pseudorandom Number Generators , 1979 .

[8]  Donald E. Knuth,et al.  The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .

[9]  Bruce W. Schmeiser,et al.  Random variate generation , 1981, WSC '81.

[10]  Averill M. Law,et al.  Simulation Modeling and Analysis , 1982 .

[11]  Paul Bratley,et al.  A guide to simulation , 1983 .

[12]  Masanori Fushimi.  Increasing the Orders of Equidistribution of the Leading Bits of the Tausworthe Sequence , 1983, Inf. Process. Lett..

[13]  Richard A. Kronmal,et al.  An acceptance-complement analogue of the mixture-plus-acceptance-rejection method for generating random variables , 1984, TOMS.

[14]  U. Fincke,et al.  Improved methods for calculating vectors of short length in a lattice , 1985 .

[15]  Luc Devroye,et al.  Sample-based non-uniform random variate generation , 1986, WSC '86.

[16]  L. Devroye.  Non-Uniform Random Variate Generation , 1986 .

[17]  Manuel Blum,et al.  A Simple Unpredictable Pseudo-Random Number Generator , 1986, SIAM J. Comput..

[18]  Paul Bratley,et al.  A guide to simulation (2nd ed.) , 1986 .

[19]  Bruce Jay Collings,et al.  Compound Random Number Generators , 1987 .

[20]  Brian D. Ripley,et al.  Stochastic Simulation , 2005 .

[21]  Timothy R. C. Read,et al.  Goodness-Of-Fit Statistics for Discrete Multivariate Data , 1988 .

[22]  N. J. A. Sloane,et al.  Sphere Packings, Lattices and Groups , 1987, Grundlehren der mathematischen Wissenschaften.

[23]  P. L'Ecuyer,et al.  About polynomial-time “unpredictable” generators , 1989, WSC '89.

[24]  Lih-Yuan Deng,et al.  Generation of Uniform Variates from Several Nearly Uniformly Distributed Variables , 1990 .

[25]  Pierre L'Ecuyer,et al.  Random numbers for simulation , 1990, CACM.

[26]  P. L’Ecuyer,et al.  Structural properties for two classes of combined random number generators , 1990 .

[27]  G. Marsaglia,et al.  A New Class of Random Number Generators , 1991 .

[28]  Pierre L'Ecuyer,et al.  Implementing a random number package with splitting facilities , 1991, TOMS.

[29]  Pierre L'Ecuyer,et al.  Efficient and portable combined Tausworthe random number generators , 1990, TOMC.

[30]  Harald Niederreiter,et al.  Random number generation and Quasi-Monte Carlo methods , 1992, CBMS-NSF regional conference series in applied mathematics.

[31]  Makoto Matsumoto,et al.  Twisted GFSR generators , 1992, TOMC.

[32]  Aaldert Compagner,et al.  On the use of reducible polynomials as random number generators , 1993 .

[33]  Shu Tezuka,et al.  On the lattice structure of the add-with-carry and subtract-with-borrow random number generators , 1993, TOMC.

[34]  Pierre L'Ecuyer,et al.  A search for good multiple recursive random number generators , 1993, TOMC.

[35]  M. Luescher,et al.  A Portable High-quality Random Number Generator for Lattice Field Theory Simulations , 1993 .

[36]  John Marsaglia,et al.  Rapid evaluation of the inverse of the normal distribution function , 1994 .

[37]  Makoto Matsumoto,et al.  Twisted GFSR generators II , 1994, TOMC.

[38]  James R. Wilson,et al.  Using bivariate Bézier distributions to model simulation input processes , 1994, Winter Simulation Conference.

[39]  P. L’Ecuyer,et al.  On the lattice structure of certain linear congruential sequences related to AWC/SWB generators , 1994 .

[40]  Pierre L'Ecuyer,et al.  Uniform random number generation , 1994, Ann. Oper. Res..

[41]  S. Tezuka.  Uniform Random Numbers: Theory and Practice , 1995 .

[42]  Jiirgen Eichenauer-Herrmann,et al.  Pseudorandom Number Generation by Nonlinear Methods , 1995 .

[43]  Shu Tezuka,et al.  Uniform Random Numbers , 1995 .

[44]  Ramarathnam Venkatesan,et al.  Design of practical and provably good random number generators , 1995, SODA '95.

[45]  T. Ala‐Nissila,et al.  Physical models as tests of randomness. , 1995, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[46]  H. Niederreiter.  The Multiple-Recursive Matrix Method for Pseudorandom Number Generation , 1995 .

[47]  Pierre L'Ecuyer,et al.  Orbits and lattices for linear random number generators with composite moduli , 1996, Math. Comput..

[48]  Pierre L'Ecuyer,et al.  Maximally equidistributed combined Tausworthe generators , 1996, Math. Comput..

[49]  Pierre L'Ecuyer,et al.  Combined Multiple Recursive Random Number Generators , 1995, Oper. Res..

[50]  Makoto Matsumoto,et al.  Strong deviations from randomness in m-sequences based on trinomials , 1996, TOMC.

[51]  Michael Luby,et al.  Pseudorandomness and cryptographic applications , 1996, Princeton computer science notes.

[52]  Ronald L. Wasserstein,et al.  Monte Carlo: Concepts, Algorithms, and Applications , 1997 .

[53]  Pierre L'Ecuyer,et al.  A random number generator based on the combination of four LCGs , 1997 .

[54]  Pierre L'Ecuyer,et al.  An Implementation of the Lattice and Spectral Tests for Multiple Recursive Linear Random Number Generators , 1997, INFORMS J. Comput..

[55]  Pierre L'Ecuyer,et al.  Distribution properties of multiply-with-c arry random number generators , 1997, Math. Comput..

[56]  Pei-Chi Wu,et al.  Multiplicative, congruential random-number generators with multiplier ± 2k1 ± 2k2 and modulus 2p - 1 , 1997, TOMS.

[57]  Pierre L'Ecuyer,et al.  Bad Lattice Structures for Vectors of Nonsuccessive Values Produced by Some Linear Recurrences , 1997, INFORMS J. Comput..

[58]  Barry L. Nelson,et al.  Input modeling tools for complex problems , 1998, 1998 Winter Simulation Conference. Proceedings (Cat. No.98CH36274).

[59]  Takuji Nishimura,et al.  Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator , 1998, TOMC.

[60]  Stefan Wegenkittl,et al.  A survey of quadratic and inversive congruential pseudorandom numbers , 1998 .

[61]  J. Gentle.  Random number generation and Monte Carlo methods , 1998 .

[62]  Pierre L'Ecuyer,et al.  Random Number Generators: Selection Criteria and Testing , 1998 .

[63]  Pierre L'Ecuyer,et al.  Tables of linear congruential generators of different sizes and good lattice structure , 1999, Math. Comput..

[64]  Pierre L'Ecuyer,et al.  Tables of maximally equidistributed combined LFSR generators , 1999, Math. Comput..

[65]  Makoto Matsumoto,et al.  Getting rid of correlations among pseudorandom numbers: discarding versus tempering , 1999, TOMC.

[66]  Pierre L'Ecuyer,et al.  Good Parameters and Implementations for Combined Multiple Recursive Random Number Generators , 1999, Oper. Res..

[67]  P. L’Ecuyer,et al.  Variance Reduction via Lattice Rules , 1999 .

[68]  Pierre L'Ecuyer,et al.  Beware of linear congruential generators with multipliers of the form a = ±2q ±2r , 1999, TOMS.

[69]  Takuji Nishimura,et al.  Tables of 64-bit Mersenne twisters , 2000, TOMC.

[70]  Pierre L'Ecuyer,et al.  Fast combined multiple recursive generators with multipliers of the form a = ±2q ±2r , 2000, WSC '00.

[71]  Pierre L'Ecuyer,et al.  Lattice computations for random numbers , 2000, Math. Comput..

[72]  Elaine B. Barker,et al.  A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications , 2000 .

[73]  P. L'Ecuyer,et al.  Fast combined multiple recursive generators with multipliers of the form a=/spl plusmn/2/sup q//spl plusmn/2/sup r/ , 2000, 2000 Winter Simulation Conference Proceedings (Cat. No.00CH37165).

[74]  Su. Centre-Ville,et al.  Construction of Equidistributed Generators based on linear recurrences modulo 2 , 2000 .

[75]  W. Hörmann,et al.  Automatic random variate generation for simulation input , 2000, 2000 Winter Simulation Conference Proceedings (Cat. No.00CH37165).

[76]  Dennis K. J. Lin,et al.  Random Number Generation for the New Century , 2000 .

[77]  Tim B. Swartz,et al.  Approximating Integrals Via Monte Carlo and Deterministic Methods , 2000 .

[78]  Josef Leydold,et al.  Automatic sampling with the ratio-of-uniforms method , 2000, TOMS.

[79]  Pierre L'Ecuyer,et al.  Software for uniform random number generation: distinguishing the good and the bad , 2001, Proceeding of the 2001 Winter Simulation Conference (Cat. No.01CH37304).

[80]  Pierre L'Ecuyer,et al.  On the performance of birthday spacings tests with certain families of random number generators , 2001 .

[81]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[82]  Pierre L'Ecuyer,et al.  Construction of Equidistributed Generators Based on Linear Recurrences Modulo 2 , 2002 .

[83]  Pierre L'Ecuyer,et al.  Recent Advances in Randomized Quasi-Monte Carlo Methods , 2002 .

[84]  Pierre L'Ecuyer,et al.  Sparse Serial Tests of Uniformity for Random Number Generators , 1998, SIAM J. Sci. Comput..

[85]  Pierre L'Ecuyer,et al.  An Object-Oriented Random-Number Package with Many Long Streams and Substreams , 2002, Oper. Res..

[86]  Igor E. Shparlinski,et al.  Recent Advances in the Theory of Nonlinear Pseudorandom Number Generators , 2002 .

[87]  Wolfgang Hörmann,et al.  Variants of Transformed Density Rejection and Correlation Induction , 2002 .

[88]  Mark Goresky,et al.  Efficient multiply-with-carry random number generators with maximal period , 2003, TOMC.

[89]  Pierre L'Ecuyer,et al.  Random Number Generators Based on Linear Recurrences in F 2 w , 2003 .

[90]  Wolfgang Hörmann,et al.  Continuous random variate generation by fast numerical inversion , 2003, TOMC.

[91]  Pierre L'Ecuyer,et al.  Combined generators with components from different families , 2003, Math. Comput. Simul..

[92]  Pierre L'Ecuyer,et al.  Randomized Polynomial Lattice Rules for Multivariate Integration and Simulation , 2001, SIAM J. Sci. Comput..

[93]  Peter Hellekalek,et al.  Empirical evidence concerning AES , 2003, TOMC.

[94]  Lih-Yuan Deng,et al.  A system of high-dimensional, efficient, long-cycle and portable uniform random number generators , 2003, TOMC.

[95]  Pierre L'Ecuyer,et al.  Random Number Generators Based on Linear Recurrences in \( \mathbb{F}_{2^w } \) , 2004 .

[96]  Pierre L’Ecuyer,et al.  Polynomial Integration Lattices , 2004 .

[97]  Pierre L'Ecuyer,et al.  On the Deng-Lin random number generators and related methods , 2004, Stat. Comput..

[98]  Lih-Yuan Deng,et al.  Efficient and portable multiple recursive generators of large order , 2005, TOMC.

[99]  Pierre L'Ecuyer,et al.  On the xorshift random number generators , 2005, TOMC.

[100]  Luc Devroye,et al.  Chapter 4 Nonuniform Random Variate Generation , 2006, Simulation.

[101]  Pierre L'Ecuyer,et al.  Improved long-period generators based on linear recurrences modulo 2 , 2004, TOMS.

[102]  Pierre L’Ecuyer,et al.  F 2-Linear Random Number Generators , 2007 .

[103]  Pierre L'Ecuyer,et al.  TestU01: A C library for empirical testing of random number generators , 2006, TOMS.

[104]  Pierre L’Ecuyer,et al.  Random Number Generation , 2008, Encyclopedia of Algorithms.

[105]  Pierre L'Ecuyer,et al.  Quasi-Monte Carlo methods with applications in finance , 2008, Finance Stochastics.

[106]  Pierre L'Ecuyer,et al.  F2-Linear Random Number Generators , 2009 .

[107]  Pierre L'Ecuyer,et al.  Importance Sampling in Rare Event Simulation , 2009, Rare Event Simulation using Monte Carlo Methods.

[108]  Wolfgang Hörmann,et al.  Automatic Nonuniform Random Variate Generation , 2011 .

[109]  Richard J. Simard,et al.  A Software Library in ANSI C for Empirical Testing of Random Number Generators , 2013 .