<p>Let xi be a random variable over a finite set with an arbitrary probability distribution. Improvements to a fast method of generating sample values for xi in constant time are suggested. The proposed modification reduces the time required for initialization to O(n). For a simple genetic algorithm, this improvement changes an O(g n 1n n) algorithm into an O(g n) algorithm (where g is the number of generations, and n is the population size).</p>

linear algorithm; random numbers; random variable; finite set; arbitrary probability distribution; simple genetic algorithm; genetic algorithms; probability; random number generation

M. Vose, "A Linear Algorithm for Generating Random Numbers with a Given Distribution," in IEEE Transactions on Software Engineering, vol. 17, no. , pp. 972-975, 1991.
doi:10.1109/32.92917