Title of article
Pseudorandom Number Generation: Impossibility and Compromise
Author/Authors
Matsumoto, Makoto Hiroshima University - Department of Mathematics, Japan , Saito, Mutsuo Hiroshima University - Department of Mathematics, Japan , Haramoto, Hiroshi Hiroshima University - Department of Mathematics, Japan , Nishimura, Takuji Yamagata University - Department of Mathematics, Japan
From page
672
To page
690
Abstract
Pseudorandom number generators are widely used in the area of simulation.Defective generators are still widely used in standard library programs, althoughbetter pseudorandom number generators such as the Mersenne Twister are freely available.This manuscript gives a brief explanation on pseudorandom number generators forMonte Carlo simulation. The existing definitions of pseudorandomness are not satisfactoriallypractical, since the generation of sequences satisfying the definitions issometimes impossible, somtimes rather slow. As a compromise, to design a fast andreliable generator, some mathematical indices are used as measures of pseudorandomness,such as the period and the higher-dimensional equidistribution property. There isno rigorous justification for the use of these indices as measures of pseudorandomness,but experiences show their usefulness in choosing pseudorandom number generators
Keywords
Random number generation , Pseudorandom number generation , MersenneTwister , Monte Carlo ethods , Simulation
Journal title
Journal of J.UCS (Journal of Universal Computer Science)
Journal title
Journal of J.UCS (Journal of Universal Computer Science)
Record number
2660446
Link To Document