The Computer Journal Advance Access published online on February 15, 2008
The Computer Journal, doi:10.1093/comjnl/bxm122
| ||||||||||||||||||||||||||||||||||||||||||||||||||
Some Comments on C. S. Wallace's Random Number Generators
Mathematical Sciences Institute, Australian National University, Canberra, ACT 0200, Australia
* Corresponding author: rpb213{at}rpbrent.com
Received 22 March 2003; revised 14 June 2003
revised 17 October 2007
We outline some of Chris Wallace's contributions to pseudo-random number generation. In particular, we consider his recent idea for generating normally distributed variates without relying on a source of uniform random numbers and compare it with more conventional methods for generating normal random numbers. Implementations of Wallace's idea can be very fast (approximately as fast as good uniform generators). We discuss the statistical quality of the output, and mention how certain pitfalls can be avoided.
Key Words: Gaussian distribution maximum-entropy distributions normal distribution orthogonal transformations random number generation Wallace algorithm