𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Random-number generators

✍ Scribed by Alan B. Forsythe

Publisher
Elsevier Science
Year
1968
Tongue
English
Weight
217 KB
Volume
1
Category
Article
ISSN
0010-4809

No coin nor oath required. For personal study only.

✦ Synopsis

A commonly used uniform random-number generator is examined in light of a genetic-simulation problem. Although this generator is often useful, it proves defective in this case. The author suggests that any proposed generator be checked for the properties needed by the simulation problem at hand.

πŸ“œ SIMILAR VOLUMES

Random number generators for microcomput
Random number generators for microcomputers
✍ Wilfred Rosenbaum; John Syrotuik; Richard Gordon πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science βš– 331 KB

The feasibility of random number generation using microcomputers is discussed and the appropriateness of alternative algorithms is evaluated on the basis of several criteria of statistical randomness. The relative deficiencies of each algorithm are cited and a modified Fibonacci generator is recomme

Random number generators tested on quant
Random number generators tested on quantum Monte Carlo simulations
✍ Kenta Hongo; Ryo Maezono; Kenichi Miura πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 254 KB

## Abstract We have tested and compared several (pseudo) random number generators (RNGs) applied to a practical application, ground state energy calculations of molecules using variational and diffusion Monte Carlo metheds. A new multiple recursive generator with 8th‐order recursion (MRG8) and the

Design of Practical and Provably Good Ra
Design of Practical and Provably Good Random Number Generators
✍ Aiello, William (author);Rajagopalan, S. Raj (author);Venkatesan, Ramarathnam (a πŸ“‚ Article πŸ“… 1998 πŸ› Academic Press 🌐 English βš– 286 KB

We present a construction for a family of pseudo-random generators that are very fast in practice, yet possess provable statistical and cryptographic unpredictability properties. Such generators are useful for simulations, randomized algorithms, and cryptography. Our starting point is a slow but hi