Poor performance of random random number generation
نویسنده
چکیده
Knuth [Knu98] shows that iterations a random function perform poorly on average as a random number generator and proposes a generalization in which the next value depends on two or more previous values. This note demonstrates the equally poor performance of a random instance in this more general model.
منابع مشابه
نقش اعداد تصادفی در شبیه سازی و بررسی تحلیلی الگوریتمهای تولید اعداد تصادفی و ارائه روش تلفیقی جدید
Abstract: Analyzing different issues of most systems, particularly their design, implementation, and development, requires some sort of techniques which are capable of studying their special conditions in stochastic states. Simulation is regarded as one of the most efficient methods for this purpose in the area of engineering, systems, and management. Studying and analyzing a system under spe...
متن کاملParallel Random Number Generation and High Performance Fortran
Michael Hennecke, Parallel Random Number Generation and High Performance Fortran, Submitted to Parallel Computing. Parallel random number generation is discussed with the proviso of generating fully reproducible random number streams on an arbitrary number of processors. The demand that data distributions onto processors should be transparent to the user is taken into account by utilizing High ...
متن کاملDirect Numerical Simulation of the Wake Flow Behind a Cylinder Using Random Vortex Method in Medium to High Reynolds Numbers
Direct numerical simulation of turbulent flow behind a cylinder, wake flow, using the random vortex method for an incompressible fluid in two dimensions is presented. In the random vortex method, the primary variable is vorticity of the flow field. After generation on the cylinder wall, it is followed in two fractional time step in a Lagrangian system of coordinates, namely convection and diffu...
متن کاملFaster Quasi Random Number Generator for Most Monte Carlo Simulations
Generating quasi-random sequences for Monte Carlo simulations has been proved of interest when comparing results with numbers coming from conventional pseudorandom sequences. Despite a fair amount of sound theoretical work on random number generation algorithms, theoretical gain is often eradicated by poor computer implementations. Recently, one of the authors of this paper showed that massive ...
متن کاملABCRNG - Swarm Intelligence in Public key Cryptography for Random Number Generation
Cryptography is an important tool for protecting and securing data. In public key cryptography, the key generation plays a vital role for strengthening the security. The random numbers are the seed values in key generation process in many of the public key cryptography algorithms, such as Elgamal, Rivest_Shamir_Adleman (RSA) algorithm etc. Much effort is dedicated to develop efficient Random Nu...
متن کامل