Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Clark RN (1985) A pseudorandom number generator. Simulation 45:252–255
Collins J, Fancilulli M, Hohlfeld R, Finch D, Sandri G, Shtatland E (1992) A random number generator based on the logit transform of the logistic variable. Comput Phys 6:630–632
Colonna J (1994) The subjectivity of computers. Commun ACM. 36:15–18
Ferrenberge A, Landau D, Wong Y (1992) Monte Carlo simulations: hidden errors from “good” random number generators. Phys Rev Lett 69:3382–3384
Gordon G (1978) System simulation. Prentice-Hall. Engelwood Cliffs, N.J
Grossman S, Thomae S (1977) Invariant, distributions and stationary correlation functions. Z Naturforsh 32a:1353
Hennecke M (1994) RANEXP: experimental random number generator package. Comput Phys Commun 79:261
James F (1990) A review of pseudorandom number generators. Comput Phys Commun 60:329–344
James (1994) RANLUX: A Fortran implementation of the high-quality pseudorandom number generator of Luscher. Comput Phys Commun 79:111–114
Jefferey H (1994) Fractals and genetics in the future. In: Pickover C (ed) Visions of the future: art, technology, and computing in the 21st century. St. Martin's Press, New York
Knuth D (1981) The art of computer programming, Vol. 2, 2nd edn. Addison-Wesley, Reading Mass
Luscher M (1994) A portable high-quality random number generator for lattice field theory simulations. Comput Phys Commun 79:100–110
Marsagilia G, Zaman A (1991) A new class of random number generators. Ann Appl Probability 1:462–480
Marsagilia G, Zaman A (1994) Some portable very-long-period random number generators. Comput Phys 8:117–121
Mckean K (1987) The orderly pursuit of disorder. Discover 5:72–81
Park S, Miller K (1988) Random numbers generators: good ones are hard to find. Commun ACM 31:1192–1201
Pickover C (1990) Computers, pattern, chaos and beauty. St. Martin's Press, N.Y
Pickover C (1991a) Picturing randomness on a graphics supercomputer. IBM J Res Devel 35:227–230
Pickover C (1991b) Computers and the imagination. St. Martin's Press, N.Y
Pickover C (1992) Mazes for the mind: computers and the unexpected. St. Martin's Press, New York
Pickover C (1994) Chaos in wonderland: visual adventures in a fractal world. St. Martin's Press, New York
Pickover C (1995a) Terrain generation via the logit transformation of the logistic variable, IEEE Comput Graph 15:18–21
Pickover C (1995b) Keys to Infinity. Wiley, New York
Pickover C, Tewksbury S (1994) Frontiers of scientific visualization. Wiley, New York
Richards T (1989) Graphical representation of pseudorandom sequences. Comput Graph 13:261–262
Schroeder M (1991) Fractals, chaos, power laws. Freeman, N.Y
Stein P, Ulam S (1964) Rozpr 39:1
Ulam S, von Neumann J (1947) Bull Am Math Soc 53:1120
Voelcker J (1988) Picturing randomness. IEEE Spectrum. 25:13
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Pickover, C.A. Random number generators: Pretty good ones are easy to find. The Visual Computer 11, 369–377 (1995). https://doi.org/10.1007/BF01909877
Issue Date:
DOI: https://doi.org/10.1007/BF01909877