Generating sums in constant average time

  • Authors:
  • Luc Devroye

  • Affiliations:
  • School of Computer Science, McGill Universiry

  • Venue:
  • WSC '88 Proceedings of the 20th conference on Winter simulation
  • Year:
  • 1988

Quantified Score

Hi-index 0.00

Visualization

Abstract

We derive an algorithm that requires uniformly bounded time to generate the sum of n iid uniform [0,1] random variables. The expected time spent on the computation of the density of the sum per generated random variate tends to zero as n →∞