Gamma distributions
October 14, 2019 — July 27, 2022
\[\renewcommand{\var}{\operatorname{Var}} \renewcommand{\corr}{\operatorname{Corr}} \renewcommand{\dd}{\mathrm{d}} \renewcommand{\bb}[1]{\mathbb{#1}} \renewcommand{\vv}[1]{\boldsymbol{#1}} \renewcommand{\rv}[1]{\mathsf{#1}} \renewcommand{\vrv}[1]{\vv{\rv{#1}}} \renewcommand{\disteq}{\stackrel{d}{=}} \renewcommand{\gvn}{\mid} \renewcommand{\Ex}{\mathbb{E}} \renewcommand{\Pr}{\mathbb{P}}\]
The density \(g(x|\alpha, \lambda )\) of the univariate Gamma is \[ g(x| \alpha, \lambda)= \frac{ \lambda^{\alpha} }{ \Gamma (\alpha) } x^{\alpha\,-\,1}e^{-\lambda x}, x\geq 0. \] People refer to this as the shape-rate parameterisation, with rate \(\lambda\) and shape \(\alpha,\).
The associated log-likelihood is of course \[ \log g(x| \alpha, \lambda)= \alpha \log \lambda + ({\alpha\,-\,1})\log x -\lambda x -\log \Gamma (\alpha) \] which I find easier to remember.
If \(\rv{g}\sim \operatorname{Gamma}(\alpha, \lambda)\) then \(\bb E(\rv{g})=\alpha/\lambda\) and \(\var(\rv{g})=\alpha/\lambda^2.\)
We use various facts about the Gamma distribution, e.g. its divisibility. Some more are outlined in the Gamma-Dirichlet algebra section.
1 Moments
The moment generating function of the Gamma distribution is \[\Ex[\exp(\rv{g} s)]=\left(1-{\frac {s}{\lambda }}\right)^{-\alpha }{\text{ for }}s<\lambda\] which gives us expressions for all moments fairly easily: \[\begin{aligned} \Ex[\rv{g}]&=\left.\frac{\dd}{\dd s}\Ex[\exp(\rv{g} t)]\right|_{s=0}\\ &=\left.\frac{\dd}{\dd s}\left(1-{\frac {s}{\lambda }}\right)^{-\alpha }\right|_{s=0}\\ &=\left.\frac{\alpha}{\lambda}\left(1-{\frac {s}{\lambda }}\right)^{-\alpha -1}\right|_{s=0}\\ &=\alpha/\lambda\\ \Ex[\rv{g}^2] &=\left.\frac{\dd}{\dd s}\frac{\alpha}{\lambda}\left(1-{\frac {s}{\lambda }}\right)^{-\alpha -1}\right|_{s=0}\\ &=\left.\frac{\alpha^2+\alpha}{\lambda^2}\left(1-{\frac {s}{\lambda }}\right)^{-\alpha -2}\right|_{s=0}\\ &=\frac{\alpha(\alpha+1)}{\lambda^2}\\ \var[\rv{g}] &=\frac{\alpha}{\lambda^2} \quad\text{(handy later)}\\ \var[\rv{g}^2] &=\frac{\Gamma (\alpha) \Gamma(\alpha+4)-\Gamma^2 (\alpha+2)}{\Gamma^2 (\alpha)\lambda ^4 }\quad\text{(handy later)}\\ \Ex[\rv{g}^3] &=\left.\frac{\dd}{\dd s}\frac{\alpha^2+\alpha}{\lambda^2}\left(1-{\frac {s}{\lambda }}\right)^{-\alpha -2}\right|_{s=0}\\ &=\frac{\alpha(\alpha+1)(\alpha+2)}{\lambda^3}\left(1-{\frac {s}{\lambda }}\right)^{-\alpha -2}\\ &=\frac{\alpha(\alpha+1)(\alpha+2)}{\lambda^3}\\ \Ex[\rv{g}^4] &=\frac{\alpha(\alpha+1)(\alpha+2)(\alpha+3)}{\lambda^4}\\ &\dots\\ \Ex[\rv{g}^n] &=\frac{\langle \alpha \rangle_{n}}{\lambda^n}\\ \end{aligned} \]
Here \(\langle \alpha \rangle_{n}:=\frac{\Gamma(\alpha+n)}{\Gamma(\alpha)}\) is the rising factorial.
2 As exponential family
The gamma distribution is a two-parameter exponential family with natural parameters \(T=[\alpha − 1,−\lambda]^\top\), and natural statistics \([X,\ln(X)]^\top.\) In fact, it is a natural exponential family with quadratic variance function (Morris 1983).
3 Linear combinations of Gammas
Is the Gamma family closed under addition? For a fixed scale/rate parameters, yes. See Gamma-Dirichlet algebra.
If we are summing gamma variates which differ in the rate parameter \(\lambda\), the result is not in general Gamma distributed. It can be compactly expressed in terms of Gamma densities, for what that is worth. If we wish to know the distribution of the sum of a set of arbitrary Gamma random variables with different rate parameters, we can try to approximate the sum with moment matching (Mathai 1982; Moschopoulos 1985) if that feel worthwhile.
Note that multiplying a gamma RV by a scalar changes the rate, so gamma variates are not close under affine combination as Gaussians ones are. The moral is that we cannot assume the convenient algebra of linear combination additivity as in the Gaussian process community. What kind of algebra do we get?
4 Gamma-Dirichlet algebra
There are various operations which give us similar conveniences, however. For those, we need to also be aware of the Dirichlet and Beta distributions. Here are some useful properties, drawn from, or extrapolated from, Dufresne (1998), Lin (2016), and Pérez-Abreu and Stelzer (2014) which use those properties.
First, we fix some notation. From here on, all variables denoted \(\rv{g}_{a}\) (for some \(a>0\), with or without superscript) have a \(\operatorname{Gamma}(a, 1)\) distribution; all variables denoted \(\rv{b}_{a, b}\) (for some \(a, b>0\), with or without superscript) have a \(\operatorname{Beta}_{a, b}\) distribution. In all expressions, the variables \(\rv{g}_{a_{1}}, \rv{g}_{a_{2}}', \ldots, \rv{b}_{a_{1}, b_{1}}, \rv{b}_{a_{2}, b_{2}}', \ldots\) are independent unless I say otherwise.
4.1 Superposition
\(\rv{g}_{\alpha_1}+\rv{g}_{\alpha_2}\sim \operatorname{Gamma}(\alpha_1+\alpha_2, \lambda)\)
4.2 Multiplication
If \(\rv{g}\sim \operatorname{Gamma}(\alpha, \lambda)\) then \(c \rv{g}\sim \operatorname{Gamma}(\alpha, \lambda/c).\) This looks useful but in practice few constructions I handle vary \(\lambda\).
4.3 Beta Thinning
\(\frac{\rv{g}_{\alpha_1}}{\rv{g}_{\alpha_1}+\rv{g}_{\alpha_2}}\sim \operatorname{Beta}(\alpha_1, \alpha_2)\) independent of \(\rv{g}_{\alpha_1}+\rv{g}_{\alpha_2}.\) Equivalently, \(\rv{g}_{\alpha_1+\alpha_2} \rv{b}_{\alpha_1,\alpha_2}\sim\operatorname{Gamma}(\alpha_1)\) independent of \(\rv{b}_{\alpha_1,\alpha_2}.\)
The Gamma-bridge construction arises from this thinning procedure.
4.4 Dirichlet thinning
Grab a set of independent Gamma rvs, \(\{\rv{g}_{a_i}\}_{i=1,\dots,k}\), and define \(\rv{s}=\sum_i\rv{g}_{a_i}.\) We know that \(\rv{s}\sim\operatorname{Gamma}(\sum_i a_i,1).\) But wait! There is more. Define \[ \rv{d}_i=\frac{\rv{g}_{a_i}}{\rv{s}}. \] The \(\rv{d}_i\sim\operatorname{Dirichlet}(\vv{\alpha})\), independently of \(\rv{s}.\)
Conversely, take some arbitrary \(\rv{g}_{A}\) and some \(\vrv{d}\sim\operatorname{Dirichlet}(\vv{a})\) with \(\sum_i a_i=B.\) Then \(\rv{g}_{A}\vrv{d}_i\sim \operatorname{Gamma}(\frac{Aa_i}{B}, \lambda),\) and also the random variates \(\rv{g}_{A}\vrv{d}_i, i=1,\dots,k\) are jointly independent.
4.5 Beta thickening
Grab a set of independent Gamma rvs, \(\{\rv{g}_{a_i}\}_{i=1,\dots,k}.\) If we take a set of Beta rvs with arbitrary dependence, \(\{\rv{b}_{\kappa_i,a_i-\kappa_i}\}_{i=1,\dots,k}\) then the product rvs \(\{(\rv{g}_{a_i}\rv{b}_{\kappa_i,a_i-\kappa_i})\sim \operatorname{Gamma}(\kappa_i,\lambda)\}_{i=1,\dots,k}\) are jointly independent Gamma variates. Thus \(\sum_i\rv{g}_{a_i}\rv{b}_{\kappa_i,a_i-\kappa_i}\sim \operatorname{Gamma}(\sum_i \kappa_i,\lambda).\) As a special case, if \(\kappa_i\equiv \kappa,\) then \(\sum_i\rv{g}_{a_i}\rv{b}_{\kappa_i,a_i-\kappa_i}\sim \operatorname{Gamma}(\sum_i \kappa_i,\lambda).\)
TODO: Check this. Also, is it actually useful? I thought it was for coupling Gamma processes, but it turned out not to be necessary in my construction.
4.6 Other
There are many other nice properties and relations.
The properties I include in this section fail to define a formal algebraic structure, but they do define a bunch of operations that preserve membership of a certain distributional family, or pretty close to. 差不多. We can define the sets and operations if we really need an algebra.
Thematically, the operations that arise most often in this Gamma-“algebra” are not quite the same as in the Gaussian process “algebra”. In that case we are usually concerned with linear algebras in that many linear operations on many objects which are Gaussian in a very broad sense still end up being Gaussian and possessed of a closed-form solution. In this case we are mostly concerned with different operations, addition yes, but also thinning (Steutel and van Harn 2003) rather than multiplication.
Yor (2007) talks about the Gamma-Beta algebra of Dufresne (1998) which relates certain Markov chains of Gamma distribution and Beta distributions. Dufresne (1998)’s construction is a formal algebra, although one that I only pull a couple of trivial cases from. Read that paper for more than the following taster:
For any \(w, x, y, z>0\), \[ \rv{b}_{w, x} \rv{g}_{y}+\rv{g}_{z}' \disteq \rv{g}_{y+z}^{\prime \prime}\left(1-\rv{b}_{x, w} \rv{b}_{y, z}'\right) . \] In particular, for any \(w, x, y>0\), \[ \rv{b}_{w, x+y} \rv{g}_{x}+\rv{g}_{y}'=\rv{g}_{x+y} \rv{b}_{w+y, x} \disteq \rv{g}_{w+y} \rv{x}_{x+y, w} . \]
For more, see the Gamma-Beta notebook.
5 Generalized Gamma Convolution
As noted under divisible distributions, the class of Generalized Gamma Convolution (GGC) is a construction that represents some startling (to me) processes as a certain type of generalization of Gamma distributions. This family includes Pareto (Thorin 1977a) and Lognormal (Thorin 1977b) distributions. Those Thorin papers introduced the idea originally; possibly it is easy to start from one of the textbooks or overviews (Bondesson 2012; James, Roynette, and Yor 2008; Steutel and van Harn 2003; Barndorff-Nielsen, Maejima, and Sato 2006).
AFAICT this allows us to prove lots of nice things about such distributions. It is less easy to get implementable computational methods this way.
The GGC convolves a Gamma distribution with some measure and makes a new divisible distribution. James, Roynette, and Yor (2008):
we say that a positive r.v. \(\Gamma\) is a generalized gamma convolution \((\mathrm{GGC})\) - … if there exists a positive Radon measure \(\mu\) on \(] 0, \infty[\) such that: \[ \begin{aligned} E\left[e^{-\lambda \Gamma}\right]=& \exp \left\{-\int_{0}^{\infty}\left(1-e^{-\lambda x}\right) \frac{d x}{x} \int_{0}^{\infty} e^{-x z} \mu(d z)\right\} \\ =& \exp \left\{-\int_{0}^{\infty} \log \left(1+\frac{\lambda}{z}\right) \mu(d z)\right\} \\ \text { with: } & \int_{] 0,1]}|\log x| \mu(d x)<\infty \text { and } \int_{[1, \infty[} \frac{\mu(d x)}{x}<\infty. \end{aligned} \]
Barndorff-Nielsen, Maejima, and Sato (2006) and Pérez-Abreu and Stelzer (2014) generalize the GGC to vector- and matrix-valued distributions.
6 Simulating Gamma variates
6.1 Univariate
A Gamma variate can be generated by many methods (Ahrens and Dieter 1974), e.g. a transformed normal and a uniform random variable (Ahrens and Dieter 1982), or two uniforms, depending on the parameter range. Most methods involve a rejection step. Here is Devroye (1986) summary for beta generators for \(0 < a, b\leq 1\) and Gamma generators for \(a<1\):
Johnk’s beta generator
REPEAT Generate iid uniform [0,1] random variates \(\rv{u}, \rv{v}\)
\[ \begin{array}{c} \rv{x} \leftarrow \rv{u}^{\frac{1}{a}}, \rv{y}-\rv{v}^{\frac{1}{b}} \\ \text { UNTL } \rv{x}+\rv{y} \leq 1 \end{array} \]
RETURN \(\frac{\rv{x}}{\rv{x}+\rv{y}}\)
\((\rv{x} \text { is beta }(a, b) \text { distributed })\)
Berman’s beta generator
REPEAT Generate iid uniform [0,1] random variates \(\rv{u}, \rv{v}\)
\[ \begin{array}{c} \rv{x} \leftarrow \rv{u}^{\frac{1}{4}}, \rv{y} \leftarrow \rv{v}^{\frac{1}{b}} \\ \text { UNTIL } \rv{x}+\rv{y} \leq \mathbf{1} \end{array} \]
RETURN \(\rv{x}\)
\((\rv{x} \text { is beta }(a, b+1) \text { distributed })\)
Johnk’s gamma generator
REPEAT Generate iid uniform [0,1] random variates \(\rv{u}, \rv{v}\)
\[ \begin{array}{r} \rv{x}+\rv{u}^{\frac{1}{a}}, \rv{y} \leftarrow \rv{v}^{\frac{1}{1-a}} \\ \text { UNTL } \rv{x}+\rv{y} \leq 1 \end{array} \]
Generate an exponential random variate \(E\) RETURN \(\frac{E \rv{x}}{\rv{x}+\rv{y}}\)
\((\rv{x} \text { is gamma ( } a\) ) distributed)
Berman’s gamma generator
REPEAT Generate iid uniform [0,1] random variates \(\rv{u}, \rv{v}\)
\[ \begin{array}{r} \rv{x} \leftarrow \rv{u}^{\frac{1}{4}}, \rv{y} \leftarrow \rv{v}^{\frac{1}{1-a}} \\ \text { UNTL } \rv{x}+\rv{y} \leq 1 \end{array} \]
Generate a gamma ( 2 ) random variate \(\rv{z}\) (either as the sum of two iid exponential random variates or as \(-\log (\rv{u} * \rv{v} *)\) where \(\rv{u} *, \rv{v} *\) are lid uniform [0,1] random variates
RETURN $ $
\((\rv{x} \text { is gamma }(a) \text { distributed })\)