Random number generators: Pretty good ones are easy to find

@article{Pickover2005RandomNG,
  title={Random number generators: Pretty good ones are easy to find},
  author={C. Pickover},
  journal={The Visual Computer},
  year={2005},
  volume={11},
  pages={369-377}
}
  • C. Pickover
  • Published 2005
  • Mathematics, Computer Science
  • The Visual Computer
A popular conception is that random number generators are very difficult to build. I informally discuss some easily programmed, easily remembered, random number generators. Simple graphical techniques are introduced for assessing the quality of the generators with little training. To encourage reader involvement, computational recipes are included. 
View on Springer
wikidata.org
1 Citations
Methods Citations
1

One Citation

Citation Type

Citation Type

Multiplicative congruential generators, their lattice structure, its relation to lattice-sublattice transformations and applications in crystallography.
  • W. Hornfeck, B. Harbrecht
  • Mathematics, Medicine
  • Acta crystallographica. Section A, Foundations of crystallography
  • 2009
TLDR
From an analysis of similar sublattices with hexagonal and square symmetry it is conjectured that the cycle structure of the permutation has its crystallographic counterpart in the description of crystallographic orbits. Expand

References

SHOWING 1-10 OF 32 REFERENCES
Random number generators: good ones are hard to find
Practical and theoretical issues are presented concerning the design, implementation, and use of a good, minimal standard random number generator that will port to virtually all systems.
RANEXP: experimental random number generator package
Abstract A library containing highly portable implementations of most algorithms for (pseudo) random number generation has been developed, which might be used in any area of simulation which requires… Expand
A Review of Pseudorandom Number Generators
This is a brief review of the current situation concerning practical pseudorandom number generation for Monte Carlo calculations. The conclusion is that pseudorandom number generators with the… Expand
Some portable very-long-period random number generators
It is found that a proposed random number generator ran2, recently presented in the Numerical Recipes column [W. H. Press and S. A. Teukolsky, Comput. Phys. 6, 521–524 (1992)], is a good one, but a… Expand
A random number generator based on the logit transform of the logistic variable
TLDR
A nonperiodic random number generator, which is based on the logistic equation, is presented and the associated algorithm can be easily utilized in laboratory exercises, classroom demonstrations, and software written for stochastic modeling purposes. Expand
Monte Carlo simulations: Hidden errors from "good" random number generators.
TLDR
This work shows how the Wolff algorithm, now accepted as the best cluster-flipping Monte Carlo algorithm for beating ``critical slowing down,'' can yield incorrect answers due to subtle correlations in ``high quality'' random number generators. Expand
RANLUX: A Fortran implementation of the high-quality pseudorandom number generator of Lüscher
TLDR
A portable Fortran 77 implementation of a high-quality generator called RANLUX (for LUXury RANdom numbers), using the algorithm of Martin Luscher described in an accompanying article. Expand
A portable high-quality random number generator for lattice field theory simulations
Abstract The theory underlying a proposed random number generator for numerical simulations in elementary particle physics and statistical mechanics is discussed. The generator is based on an… Expand
A pseudorandom number generator
A simple deterministic algorithm produces a finite sequence which exhibits three iniportant statistical properties. This algo rithm should prove to be useful in simulating some random processes.
Graphical representation of pseudorandom sequences
TLDR
A simple application of a chaos-analysis technique to expose the non-randomness of the BASIC random number generator. Expand
...
1
2
3
4
...