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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…