Convolution random number generator: Difference between revisions

Revision as of 02:23, 22 May 2020

Latest revision as of 07:32, 7 February 2025

(One intermediate revision by one other user not shown)

Line 1:

{{short description|Non-uniform number generator}}

{{More references|date=February 2025}}

In [[statistics]] and [[computer software]], a '''convolution random number generator''' is a [[pseudo-random number sampling]] method that can be used to generate [[random variate]]s from certain classes of [[probability distribution]]. The particular advantage of this type of approach is that it allows advantage to be taken of existing software for generating random variates from other, usually non-uniform, distributions. However, faster algorithms may be obtainable for the same distributions by other more complicated approaches.<ref>Antonov, N. (2020). [https://core.ac.uk/download/pdf/326322436.pdf ''Random number generator based on multiplicative convolution transform.'']</ref>

A number of distributions can be expressed in terms of the (possibly weighted) sum of two or more [[random variable]]s from other distributions. (The distribution of the sum is the [[convolution]] of the distributions of the individual random variables).

Line 16 ⟶ 17:

if <math>X_i\ \sim \operatorname{Exp}(k \theta)</math>&nbsp; &nbsp; then <math>X=\sum_{i=1}^k X_i \sim \operatorname{Erlang}(k,\theta) .</math>

== References ==

{{unreferenced|date=November 2010}}

{{reflist}}

[[Category:Non-uniform random numbers]]