This article's lead section may be too short to adequately summarize the key points. Please consider expanding the lead to provide an accessible overview of all important aspects of the article. (November 2022)

Probability density function | |||

Cumulative distribution function | |||

Parameters | |||
---|---|---|---|

Support | |||

CDF | |||

Mean | |||

Median | No simple closed form | No simple closed form | |

Mode | , | ||

Variance | |||

Skewness | |||

Ex. kurtosis | |||

Entropy | |||

MGF | |||

CF | |||

Fisher information | |||

Method of Moments |

In probability theory and statistics, the **gamma distribution** is a two-parameter family of continuous probability distributions. The exponential distribution, Erlang distribution, and chi-squared distribution are special cases of the gamma distribution. There are two equivalent parameterizations in common use:

- With a shape parameter and a scale parameter .
- With a shape parameter and an inverse scale parameter , called a rate parameter.

In each of these forms, both parameters are positive real numbers.

The gamma distribution is the maximum entropy probability distribution (both with respect to a uniform base measure and a base measure) for a random variable for which **E**[*X*] = *kθ* = *α*/*β* is fixed and greater than zero, and **E**[ln(*X*)] = *ψ*(*k*) + ln(*θ*) = *ψ*(*α*) − ln(*β*) is fixed (*ψ* is the digamma function).^{[1]}

The parameterization with *k* and *θ* appears to be more common in econometrics and other applied fields, where the gamma distribution is frequently used to model waiting times. For instance, in life testing, the waiting time until death is a random variable that is frequently modeled with a gamma distribution. See Hogg and Craig^{[2]} for an explicit motivation.

The parameterization with and is more common in Bayesian statistics, where the gamma distribution is used as a conjugate prior distribution for various types of inverse scale (rate) parameters, such as the *λ* of an exponential distribution or a Poisson distribution^{[3]} – or for that matter, the *β* of the gamma distribution itself. The closely related inverse-gamma distribution is used as a conjugate prior for scale parameters, such as the variance of a normal distribution.

If *k* is a positive integer, then the distribution represents an Erlang distribution; i.e., the sum of *k* independent exponentially distributed random variables, each of which has a mean of *θ*.

The gamma distribution can be parameterized in terms of a shape parameter *α* = *k* and an inverse scale parameter *β* = 1/*θ*, called a rate parameter. A random variable *X* that is gamma-distributed with shape *α* and rate *β* is denoted

The corresponding probability density function in the shape-rate parameterization is

where is the gamma function. For all positive integers, .

The cumulative distribution function is the regularized gamma function:

where is the lower incomplete gamma function.

If *α* is a positive integer (i.e., the distribution is an Erlang distribution), the cumulative distribution function has the following series expansion:^{[4]}

A random variable *X* that is gamma-distributed with shape *k* and scale *θ* is denoted by

The probability density function using the shape-scale parametrization is

Here Γ(*k*) is the gamma function evaluated at *k*.

The cumulative distribution function is the regularized gamma function:

where is the lower incomplete gamma function.

It can also be expressed as follows, if *k* is a positive integer (i.e., the distribution is an Erlang distribution):^{[4]}

Both parametrizations are common because either can be more convenient depending on the situation.

The mean of gamma distribution is given by the product of its shape and scale parameters:

The variance is:

The square root of the inverse shape parameter gives the coefficient of variation:

The skewness of the gamma distribution only depends on its shape parameter, *k*, and it is equal to

The *n*th raw moment is given by:

Unlike the mode and the mean, which have readily calculable formulas based on the parameters, the median does not have a closed-form equation. The median for this distribution is the value such that

A rigorous treatment of the problem of determining an asymptotic expansion and bounds for the median of the gamma distribution was handled first by Chen and Rubin, who proved that (for )

where is the mean and is the median of the distribution.^{[5]} For other values of the scale parameter, the mean scales to , and the median bounds and approximations would be similarly scaled by .

K. P. Choi found the first five terms in a Laurent series asymptotic approximation of the median by comparing the median to Ramanujan's function.^{[6]} Berg and Pedersen found more terms:^{[7]}

Partial sums of these series are good approximations for high enough ; they are not plotted in the figure, which is focused on the low- region that is less well approximated.

Berg and Pedersen also proved many properties of the median, showing that it is a convex function of ,^{[8]} and that the asymptotic behavior near is (where is the Euler–Mascheroni constant), and that for all the median is bounded by .^{[7]}

A closer linear upper bound, for only, was provided in 2021 by Gaunt and Merkle,^{[9]} relying on the Berg and Pedersen result that the slope of is everywhere less than 1:

- for (with equality at )

which can be extended to a bound for all by taking the max with the chord shown in the figure, since the median was proved convex.^{[8]}

An approximation to the median that is asymptotically accurate at high and reasonable down to or a bit lower follows from the Wilson–Hilferty transformation:

which goes negative for .

In 2021, Lyon proposed several closed-form approximations of the form . He conjectured closed-form values of and for which this approximation is an asymptotically tight upper or lower bound for all . In particular:^{[10]}

- is a lower bound, asymptotically tight as
- is an upper bound, asymptotically tight as

Lyon also derived two other lower bounds that are not closed-form expressions, including this one based on solving the integral expression substituting 1 for :

- (approaching equality as )

and the tangent line at where the derivative was found to be :

- (with equality at )

where Ei is the exponential integral.^{[10]}

Additionally, he showed that interpolations between bounds could provide excellent approximations or tighter bounds to the median, including an approximation that is exact at (where ) and has a maximum relative error less than 0.6%. Interpolated approximations and bounds are all of the form

where is an interpolating function running monotonically from 0 at low to 1 at high , approximating an ideal, or exact, interpolator :

For the simplest interpolating function considered, a first-order rational function

the tightest lower bound has

and the tightest upper bound has

The interpolated bounds are plotted (mostly inside the yellow region) in the log–log plot shown. Even tighter bounds are available using different interpolating functions, but not usually with closed-form parameters like these.^{[10]}

If *X*_{i} has a Gamma(*k*_{i}, *θ*) distribution for *i* = 1, 2, ..., *N* (i.e., all distributions have the same scale parameter *θ*), then

provided all *X*_{i} are independent.

For the cases where the *X*_{i} are independent but have different scale parameters, see Mathai ^{[11]} or Moschopoulos.^{[12]}

The gamma distribution exhibits infinite divisibility.

If

then, for any *c* > 0,

- by moment generating functions,

or equivalently, if

- (shape-rate parameterization)

Indeed, we know that if *X* is an exponential r.v. with rate *λ*, then *cX* is an exponential r.v. with rate *λ*/*c*; the same thing is valid with Gamma variates (and this can be checked using the moment-generating function, see, e.g.,these notes, 10.4-(ii)): multiplication by a positive constant *c* divides the rate (or, equivalently, multiplies the scale).

The gamma distribution is a two-parameter exponential family with natural parameters *k* − 1 and −1/*θ* (equivalently, *α* − 1 and −*β*), and natural statistics *X* and ln(*X*).

If the shape parameter *k* is held fixed, the resulting one-parameter family of distributions is a natural exponential family.

One can show that

or equivalently,

where is the digamma function. Likewise,

where is the trigamma function.

This can be derived using the exponential family formula for the moment generating function of the sufficient statistic, because one of the sufficient statistics of the gamma distribution is ln(*x*).

The information entropy is

In the *k*, *θ* parameterization, the information entropy is given by

The Kullback–Leibler divergence (KL-divergence), of Gamma(*α*_{p}, *β*_{p}) ("true" distribution) from Gamma(*α*_{q}, *β*_{q}) ("approximating" distribution) is given by^{[13]}

Written using the *k*, *θ* parameterization, the KL-divergence of Gamma(*k _{p}*, θ

The Laplace transform of the gamma PDF is

- Let be independent and identically distributed random variables following an exponential distribution with rate parameter λ, then ~ Gamma(n, 1/λ) where n is the shape parameter and
*λ*is the rate, and where the rate changes*nλ*. - If
*X*~ Gamma(1,*λ*) (in the shape–rate parametrization), then*X*has an exponential distribution with rate parameter*λ*. In the shape-scale parametrization,*X*~ Gamma(1,*λ*) has an exponential distribution with rate parameter 1/*λ*. - If
*X*~ Gamma(*ν*/2, 2) (in the shape–scale parametrization), then*X*is identical to*χ*^{2}(*ν*), the chi-squared distribution with*ν*degrees of freedom. Conversely, if*Q*~*χ*^{2}(*ν*) and*c*is a positive constant, then*cQ*~ Gamma(*ν*/2, 2*c*). - If
*θ=1/k*, one obtains the Schulz-Zimm distribution, which is most prominently used to model polymer chain lengths. - If
*k*is an integer, the gamma distribution is an Erlang distribution and is the probability distribution of the waiting time until the*k*th "arrival" in a one-dimensional Poisson process with intensity 1/*θ*. If

- then

- If
*X*has a Maxwell–Boltzmann distribution with parameter*a*, then

- If
*X*~ Gamma(*k*,*θ*), then follows an exponential-gamma (abbreviated exp-gamma) distribution.^{[14]}It is sometimes referred to as the log-gamma distribution.^{[15]}Formulas for its mean and variance are in the section #Logarithmic expectation and variance. - If
*X*~ Gamma(*k*,*θ*), then follows a generalized gamma distribution with parameters*p*= 2,*d*= 2*k*, and^{[citation needed]}. - More generally, if
*X*~ Gamma(*k*,*θ*), then for follows a generalized gamma distribution with parameters*p*= 1/*q*,*d*=*k*/*q*, and . - If
*X*~ Gamma(*k*,*θ*) with shape*k*and scale*θ*, then 1/*X*~ Inv-Gamma(*k*,*θ*^{−1}) (see Inverse-gamma distribution for derivation). - Parametrization 1: If are independent, then , or equivalently,
- Parametrization 2: If are independent, then , or equivalently,
- If
*X*~ Gamma(*α*,*θ*) and*Y*~ Gamma(*β*,*θ*) are independently distributed, then*X*/(*X*+*Y*) has a beta distribution with parameters*α*and*β*, and*X*/(*X*+*Y*) is independent of*X*+*Y*, which is Gamma(*α*+*β*,*θ*)-distributed. - If
*X*_{i}~ Gamma(*α*_{i}, 1) are independently distributed, then the vector (*X*_{1}/*S*, ...,*X*/_{n}*S*), where*S*=*X*_{1}+ ... +*X*, follows a Dirichlet distribution with parameters_{n}*α*_{1}, ...,*α*_{n}. - For large
*k*the gamma distribution converges to normal distribution with mean*μ*=*kθ*and variance*σ*^{2}=*kθ*^{2}. - The gamma distribution is the conjugate prior for the precision of the normal distribution with known mean.
- The matrix gamma distribution and the Wishart distribution are multivariate generalizations of the gamma distribution (samples are positive-definite matrices rather than positive real numbers).
- The gamma distribution is a special case of the generalized gamma distribution, the generalized integer gamma distribution, and the generalized inverse Gaussian distribution.
- Among the discrete distributions, the negative binomial distribution is sometimes considered the discrete analog of the gamma distribution.
- Tweedie distributions – the gamma distribution is a member of the family of Tweedie exponential dispersion models.
- Modified Half-normal distribution – the Gamma distribution is a member of the family of Modified half-normal distribution.
^{[16]}The corresponding density is , where denotes the Fox–Wright Psi function. - For the shape-scale parameterization , if the scale parameter where denotes the Inverse-gamma distribution, then the marginal distribution where denotes the Beta prime distribution.

If the shape parameter of the gamma distribution is known, but the inverse-scale parameter is unknown, then a gamma distribution for the inverse scale forms a conjugate prior. The compound distribution, which results from integrating out the inverse scale, has a closed-form solution known as the compound gamma distribution.^{[17]}

If, instead, the shape parameter is known but the mean is unknown, with the prior of the mean being given by another gamma distribution, then it results in K-distribution.

The gamma distribution can be expressed as the product distribution of a Weibull distribution and a variant form of the stable count distribution. Its shape parameter can be regarded as the inverse of Lévy's stability parameter in the stable count distribution:

where is a standard stable count distribution of shape , and is a standard Weibull distribution of shape .

The likelihood function for *N* iid observations (*x*_{1}, ..., *x*_{N}) is

from which we calculate the log-likelihood function

Finding the maximum with respect to *θ* by taking the derivative and setting it equal to zero yields the maximum likelihood estimator of the *θ* parameter, which equals the sample mean divided by the shape parameter *k*:

Substituting this into the log-likelihood function gives

We need at least two samples: , because for , the function increases without bounds as . For , it can be verified that is strictly concave, by using inequality properties of the polygamma function. Finding the maximum with respect to *k* by taking the derivative and setting it equal to zero yields

where is the digamma function and is the sample mean of ln(*x*). There is no closed-form solution for *k*. The function is numerically very well behaved, so if a numerical solution is desired, it can be found using, for example, Newton's method. An initial value of *k* can be found either using the method of moments, or using the approximation

If we let

then *k* is approximately

which is within 1.5% of the correct value.^{[18]} An explicit form for the Newton–Raphson update of this initial guess is:^{[19]}

At the maximum-likelihood estimate , the expected values for and agree with the empirical averages:

For data, , that is represented in a floating point format that underflows to 0 for values smaller than , the logarithms that are needed for the maximum-likelihood estimate will cause failure if there are any underflows. If we assume the data was generated by a gamma distribution with cdf , then the probability that there is at least one underflow is:

This probability will approach 1 for small and large . For example, at , and , . A workaround is to instead have the data in logarithmic format.

In order to test an implementation of a maximum-likelihood estimator that takes logarithmic data as input, it is useful to be able to generate non-underflowing logarithms of random gamma variates, when . Following the implementation in `scipy.stats.loggamma`

, this can be done as follows:^{[20]} sample and independently. Then the required logarithmic sample is , so that .

Consistent closed-form estimators of *k* and *θ* exists that are derived from the likelihood of the generalized gamma distribution.^{[21]}

The estimate for the shape *k* is

and the estimate for the scale *θ* is

Using the sample mean of *x*, the sample mean of ln(*x*), and the sample mean of the product *x*·ln(*x*) simplifies the expressions to:

If the rate parameterization is used, the estimate of .

These estimators are not strictly maximum likelihood estimators, but are instead referred to as mixed type log-moment estimators. They have however similar efficiency as the maximum likelihood estimators.

Although these estimators are consistent, they have a small bias. A bias-corrected variant of the estimator for the scale *θ* is

A bias correction for the shape parameter *k* is given as^{[22]}

With known *k* and unknown *θ*, the posterior density function for theta (using the standard scale-invariant prior for *θ*) is

Denoting

Integration with respect to *θ* can be carried out using a change of variables, revealing that 1/*θ* is gamma-distributed with parameters *α* = *Nk*, *β* = *y*.

The moments can be computed by taking the ratio (*m* by *m* = 0)

which shows that the mean ± standard deviation estimate of the posterior distribution for *θ* is

In Bayesian inference, the **gamma distribution** is the conjugate prior to many likelihood distributions: the Poisson, exponential, normal (with known mean), Pareto, gamma with known shape *σ*, inverse gamma with known shape parameter, and Gompertz with known scale parameter.

The gamma distribution's conjugate prior is:^{[23]}

where *Z* is the normalizing constant with no closed-form solution.
The posterior distribution can be found by updating the parameters as follows:

where *n* is the number of observations, and *x _{i}* is the

Consider a sequence of events, with the waiting time for each event being an exponential distribution with rate . Then the waiting time for the -th event to occur is the gamma distribution with integer shape . This construction of the gamma distribution allows it to model a wide variety of phenomena where several sub-events, each taking time with exponential distribution, must happen in sequence for a major event to occur.^{[24]} Examples include the waiting time of cell-division events,^{[25]} number of compensatory mutations for a given mutation,^{[26]} waiting time until a repair is necessary for a hydraulic system,^{[27]} and so on.

The gamma distribution has been used to model the size of insurance claims^{[28]} and rainfalls.^{[29]} This means that aggregate insurance claims and the amount of rainfall accumulated in a reservoir are modelled by a gamma process – much like the exponential distribution generates a Poisson process.

The gamma distribution is also used to model errors in multi-level Poisson regression models because a mixture of Poisson distributions with gamma-distributed rates has a known closed form distribution, called negative binomial.

In wireless communication, the gamma distribution is used to model the multi-path fading of signal power;^{[citation needed]} see also Rayleigh distribution and Rician distribution.

In oncology, the age distribution of cancer incidence often follows the gamma distribution, wherein the shape and scale parameters predict, respectively, the number of driver events and the time interval between them.^{[30]}^{[31]}

In neuroscience, the gamma distribution is often used to describe the distribution of inter-spike intervals.^{[32]}^{[33]}

In bacterial gene expression, the copy number of a constitutively expressed protein often follows the gamma distribution, where the scale and shape parameter are, respectively, the mean number of bursts per cell cycle and the mean number of protein molecules produced by a single mRNA during its lifetime.^{[34]}

In genomics, the gamma distribution was applied in peak calling step (i.e., in recognition of signal) in ChIP-chip^{[35]} and ChIP-seq^{[36]} data analysis.

In Bayesian statistics, the gamma distribution is widely used as a conjugate prior. It is the conjugate prior for the precision (i.e. inverse of the variance) of a normal distribution. It is also the conjugate prior for the exponential distribution.

Given the scaling property above, it is enough to generate gamma variables with *θ* = 1, as we can later convert to any value of *β* with a simple division.

Suppose we wish to generate random variables from Gamma(*n* + *δ*, 1), where n is a non-negative integer and 0 < *δ* < 1. Using the fact that a Gamma(1, 1) distribution is the same as an Exp(1) distribution, and noting the method of generating exponential variables, we conclude that if *U* is uniformly distributed on (0, 1], then −ln(*U*) is distributed Gamma(1, 1) (i.e. inverse transform sampling). Now, using the "*α*-addition" property of gamma distribution, we expand this result:

where *U*_{k} are all uniformly distributed on (0, 1] and independent. All that is left now is to generate a variable distributed as Gamma(*δ*, 1) for 0 < *δ* < 1 and apply the "*α*-addition" property once more. This is the most difficult part.

Random generation of gamma variates is discussed in detail by Devroye,^{[37]}^{: 401–428 } noting that none are uniformly fast for all shape parameters. For small values of the shape parameter, the algorithms are often not valid.^{[37]}^{: 406 } For arbitrary values of the shape parameter, one can apply the Ahrens and Dieter^{[38]} modified acceptance-rejection method Algorithm GD (shape *k* ≥ 1), or transformation method^{[39]} when 0 < *k* < 1. Also see Cheng and Feast Algorithm GKM 3^{[40]} or Marsaglia's squeeze method.^{[41]}

The following is a version of the Ahrens-Dieter acceptance–rejection method:^{[38]}

- Generate
*U*,*V*and*W*as iid uniform (0, 1] variates. - If then and . Otherwise, and .
- If then go to step 1.
*ξ*is distributed as Γ(*δ*, 1).

A summary of this is

where is the integer part of *k*, *ξ* is generated via the algorithm above with *δ* = {*k*} (the fractional part of *k*) and the *U*_{k} are all independent.

While the above approach is technically correct, Devroye notes that it is linear in the value of *k* and generally is not a good choice. Instead, he recommends using either rejection-based or table-based methods, depending on context.^{[37]}^{: 401–428 }

For example, Marsaglia's simple transformation-rejection method relying on one normal variate *X* and one uniform variate *U*:^{[20]}

- Set and .
- Set .
- If and return , else go back to step 2.

With generates a gamma distributed random number in time that is approximately constant with *k*. The acceptance rate does depend on *k*, with an acceptance rate of 0.95, 0.98, and 0.99 for k=1, 2, and 4. For *k* < 1, one can use to boost *k* to be usable with this method.