arXiv · cond-mat/9901202
Algorithm for normal random numbers
Abstract
We propose a simple algorithm for generating normally distributed pseudo random numbers. The algorithm simulates N molecules that exchange energy among themselves following a simple stochastic rule. We prove that the system is ergodic, and that a Maxwell like distribution that may be used as a source of normally distributed random deviates follows when N tends to infinity. The algorithm passes various performance tests, including Monte Carlo simulation of a finite 2D Ising model using Wolff's algorithm. It only requires four simple lines of computer code, and is approximately ten times faster than the Box-Muller algorithm.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
J. F. Fernandez, Carlos Criado. 1999-01-20. Algorithm for normal random numbers. https://doi.org/10.1103/physreve.60.3361
Cite the original work for its findings. Save a collection to share your selection of sources.