Moment-generating Function
Get Moment-generating Function essential facts below. View Videos or join the Moment-generating Function discussion. Add Moment-generating Function to your PopFlock.com topic list for future reference or share this resource on social media.
Moment-generating Function

In probability theory and statistics, the moment-generating function of a real-valued random variable is an alternative specification of its probability distribution. Thus, it provides the basis of an alternative route to analytical results compared with working directly with probability density functions or cumulative distribution functions. There are particularly simple results for the moment-generating functions of distributions defined by the weighted sums of random variables. However, not all random variables have moment-generating functions.

As its name implies, the moment generating function can be used to compute a distribution's moments: the nth moment about 0 is the nth derivative of the moment-generating function, evaluated at 0.

In addition to real-valued distributions (univariate distributions), moment-generating functions can be defined for vector- or matrix-valued random variables, and can even be extended to more general cases.

The moment-generating function of a real-valued distribution does not always exist, unlike the characteristic function. There are relations between the behavior of the moment-generating function of a distribution and properties of the distribution, such as the existence of moments.

## Definition

The moment-generating function of a random variable X is

${\displaystyle M_{X}(t):=\operatorname {E} \left[e^{tX}\right],\quad t\in \mathbb {R} ,}$

wherever this expectation exists. In other words, the moment-generating function is the expectation of the random variable ${\displaystyle e^{tX}}$. More generally, when ${\displaystyle \mathbf {X} =(X_{1},\ldots ,X_{n})^{\mathrm {T} }}$, an ${\displaystyle n}$-dimensional random vector, and ${\displaystyle \mathbf {t} }$ is a fixed vector, one uses ${\displaystyle \mathbf {t} \cdot \mathbf {X} =\mathbf {t} ^{\mathrm {T} }\mathbf {X} }$ instead of ${\displaystyle tX}$:

${\displaystyle M_{\mathbf {X} }(\mathbf {t} ):=\operatorname {E} \left(e^{\mathbf {t} ^{\mathrm {T} }\mathbf {X} }\right).}$

${\displaystyle M_{X}(0)}$ always exists and is equal to 1. However, a key problem with moment-generating functions is that moments and the moment-generating function may not exist, as the integrals need not converge absolutely. By contrast, the characteristic function or Fourier transform always exists (because it is the integral of a bounded function on a space of finite measure), and for some purposes may be used instead.

The moment-generating function is so named because it can be used to find the moments of the distribution.[1] The series expansion of ${\displaystyle e^{tX}}$ is

${\displaystyle e^{t\,X}=1+t\,X+{\frac {t^{2}\,X^{2}}{2!}}+{\frac {t^{3}\,X^{3}}{3!}}+\cdots +{\frac {t^{n}\,X^{n}}{n!}}+\cdots .}$

Hence

{\displaystyle {\begin{aligned}M_{X}(t)=\operatorname {E} (e^{t\,X})&=1+t\operatorname {E} (X)+{\frac {t^{2}\operatorname {E} (X^{2})}{2!}}+{\frac {t^{3}\operatorname {E} (X^{3})}{3!}}+\cdots +{\frac {t^{n}\operatorname {E} (X^{n})}{n!}}+\cdots \\&=1+tm_{1}+{\frac {t^{2}m_{2}}{2!}}+{\frac {t^{3}m_{3}}{3!}}+\cdots +{\frac {t^{n}m_{n}}{n!}}+\cdots ,\end{aligned}}}

where ${\displaystyle m_{n}}$ is the ${\displaystyle n}$th moment. Differentiating ${\displaystyle M_{X}(t)}$ ${\displaystyle i}$ times with respect to ${\displaystyle t}$ and setting ${\displaystyle t=0}$, we obtain the ${\displaystyle i}$th moment about the origin, ${\displaystyle m_{i}}$; see Calculations of moments below.

If ${\displaystyle X}$ is a continuous random variable, the following relation between its moment-generating function ${\displaystyle M_{X}(t)}$ and the two-sided Laplace transform of its probability density function ${\displaystyle f_{X}(x)}$ holds:

${\displaystyle M_{X}(t)={\mathcal {L}}\{f_{X}\}(-t),}$

since the PDF's two-sided Laplace transform is given as

${\displaystyle {\mathcal {L}}\{f_{X}\}(s)=\int _{-\infty }^{\infty }e^{-sx}f_{X}(x)\,dx,}$

and the moment-generating function's definition expands (by the law of the unconscious statistician) to

${\displaystyle M_{X}(t)=\operatorname {E} \left[e^{tX}\right]=\int _{-\infty }^{\infty }e^{tx}f_{X}(x)\,dx.}$

This is consistent with the characteristic function of ${\displaystyle X}$ being a Wick rotation of ${\displaystyle M_{X}(t)}$ when the moment generating function exists, as the characteristic function of a continuous random variable ${\displaystyle X}$ is the Fourier transform of its probability density function ${\displaystyle f_{X}(x)}$, and in general when a function ${\displaystyle f(x)}$ is of exponential order, the Fourier transform of ${\displaystyle f}$ is a Wick rotation of its two-sided Laplace transform in the region of convergence. See the relation of the Fourier and Laplace transforms for further information.

## Examples

Here are some examples of the moment-generating function and the characteristic function for comparison. It can be seen that the characteristic function is a Wick rotation of the moment-generating function ${\displaystyle M_{X}(t)}$ when the latter exists.

Distribution Moment-generating function ${\displaystyle M_{X}(t)}$ Characteristic function ${\displaystyle \varphi (t)}$
Degenerate ${\displaystyle \delta _{a}}$ ${\displaystyle e^{ta}}$ ${\displaystyle e^{ita}}$
Bernoulli ${\displaystyle P(X=1)=p}$ ${\displaystyle 1-p+pe^{t}}$ ${\displaystyle 1-p+pe^{it}}$
Geometric ${\displaystyle (1-p)^{k-1}\,p}$ ${\displaystyle {\frac {pe^{t}}{1-(1-p)e^{t}}}}$
${\displaystyle \forall t<-\ln(1-p)}$
${\displaystyle {\frac {pe^{it}}{1-(1-p)\,e^{it}}}}$
Binomial ${\displaystyle B(n,p)}$ ${\displaystyle \left(1-p+pe^{t}\right)^{n}}$ ${\displaystyle \left(1-p+pe^{it}\right)^{n}}$
Negative Binomial ${\displaystyle NB(r,p)}$ ${\displaystyle {\frac {(1-p)^{r}}{\left(1-pe^{t}\right)^{r}}}}$ ${\displaystyle {\frac {(1-p)^{r}}{\left(1-pe^{it}\right)^{r}}}}$
Poisson ${\displaystyle Pois(\lambda )}$ ${\displaystyle e^{\lambda (e^{t}-1)}}$ ${\displaystyle e^{\lambda (e^{it}-1)}}$
Uniform (continuous) ${\displaystyle U(a,b)}$ ${\displaystyle {\frac {e^{tb}-e^{ta}}{t(b-a)}}}$ ${\displaystyle {\frac {e^{itb}-e^{ita}}{it(b-a)}}}$
Uniform (discrete) ${\displaystyle DU(a,b)}$ ${\displaystyle {\frac {e^{at}-e^{(b+1)t}}{(b-a+1)(1-e^{t})}}}$ ${\displaystyle {\frac {e^{ait}-e^{(b+1)it}}{(b-a+1)(1-e^{it})}}}$
Laplace ${\displaystyle L(\mu ,b)}$ ${\displaystyle {\frac {e^{t\mu }}{1-b^{2}t^{2}}},~|t|<1/b}$ ${\displaystyle {\frac {e^{it\mu }}{1+b^{2}t^{2}}}}$
Normal ${\displaystyle N(\mu ,\sigma ^{2})}$ ${\displaystyle e^{t\mu +{\frac {1}{2}}\sigma ^{2}t^{2}}}$ ${\displaystyle e^{it\mu -{\frac {1}{2}}\sigma ^{2}t^{2}}}$
Chi-squared ${\displaystyle \mathrm {X} _{k}^{2}}$ ${\displaystyle (1-2t)^{-{\frac {k}{2}}}}$ ${\displaystyle (1-2it)^{-{\frac {k}{2}}}}$
Noncentral chi-squared ${\displaystyle \mathrm {X} _{k}^{2}(\lambda )}$ ${\displaystyle e^{\lambda t/(1-2t)}(1-2t)^{-{\frac {k}{2}}}}$ ${\displaystyle e^{i\lambda t/(1-2it)}(1-2it)^{-{\frac {k}{2}}}}$
Gamma ${\displaystyle \Gamma (k,\theta )}$ ${\displaystyle (1-t\theta )^{-k},~\forall t<{\tfrac {1}{\theta }}}$ ${\displaystyle (1-it\theta )^{-k}}$
Exponential ${\displaystyle Exp(\lambda )}$ ${\displaystyle \left(1-t\lambda ^{-1}\right)^{-1},~t<\lambda }$ ${\displaystyle \left(1-it\lambda ^{-1}\right)^{-1}}$
Multivariate normal ${\displaystyle N(\mathbf {\mu } ,\mathbf {\Sigma } )}$ ${\displaystyle e^{\mathbf {t} ^{\mathrm {T} }\left({\boldsymbol {\mu }}+{\frac {1}{2}}\mathbf {\Sigma t} \right)}}$ ${\displaystyle e^{\mathbf {t} ^{\mathrm {T} }\left(i{\boldsymbol {\mu }}-{\frac {1}{2}}{\boldsymbol {\Sigma }}\mathbf {t} \right)}}$
Cauchy ${\displaystyle Cauchy(\mu ,\theta )}$ Does not exist ${\displaystyle e^{it\mu -\theta |t|}}$
Multivariate Cauchy

${\displaystyle MultiCauchy(\mu ,\Sigma )}$[2]

Does not exist ${\displaystyle \!\,e^{i\mathbf {t} ^{\mathrm {T} }{\boldsymbol {\mu }}-{\sqrt {\mathbf {t} ^{\mathrm {T} }{\boldsymbol {\Sigma }}\mathbf {t} }}}}$

## Calculation

The moment-generating function is the expectation of a function of the random variable, it can be written as:

• For a discrete probability mass function, ${\displaystyle M_{X}(t)=\sum _{i=1}^{\infty }e^{tx_{i}}\,p_{i}}$
• For a continuous probability density function, ${\displaystyle M_{X}(t)=\int _{-\infty }^{\infty }e^{tx}f(x)\,dx}$
• In the general case: ${\displaystyle M_{X}(t)=\int _{-\infty }^{\infty }e^{tx}\,dF(x)}$, using the Riemann–Stieltjes integral, and where ${\displaystyle F}$ is the cumulative distribution function.

Note that for the case where ${\displaystyle X}$ has a continuous probability density function ${\displaystyle f(x)}$, ${\displaystyle M_{X}(-t)}$ is the two-sided Laplace transform of ${\displaystyle f(x)}$.

{\displaystyle {\begin{aligned}M_{X}(t)&=\int _{-\infty }^{\infty }e^{tx}f(x)\,dx\\&=\int _{-\infty }^{\infty }\left(1+tx+{\frac {t^{2}x^{2}}{2!}}+\cdots +{\frac {t^{n}x^{n}}{n!}}+\cdots \right)f(x)\,dx\\&=1+tm_{1}+{\frac {t^{2}m_{2}}{2!}}+\cdots +{\frac {t^{n}m_{n}}{n!}}+\cdots ,\end{aligned}}}

where ${\displaystyle m_{n}}$ is the ${\displaystyle n}$th moment.

### Linear transformations of random variables

If random variable ${\displaystyle X}$ has moment generating function ${\displaystyle M_{X}(t)}$, then ${\displaystyle \alpha X+\beta }$ has moment generating function ${\displaystyle M_{\alpha X+\beta }(t)=e^{\beta t}M_{X}(\alpha t)}$

${\displaystyle M_{\alpha X+\beta }(t)=E[e^{(\alpha X+\beta )t}]=e^{\beta t}E[e^{\alpha Xt}]=e^{\beta t}M_{X}(\alpha t)}$

### Linear combination of independent random variables

If ${\displaystyle S_{n}=\sum _{i=1}^{n}a_{i}X_{i}}$, where the Xi are independent random variables and the ai are constants, then the probability density function for Sn is the convolution of the probability density functions of each of the Xi, and the moment-generating function for Sn is given by

${\displaystyle M_{S_{n}}(t)=M_{X_{1}}(a_{1}t)M_{X_{2}}(a_{2}t)\cdots M_{X_{n}}(a_{n}t)\,.}$

### Vector-valued random variables

For vector-valued random variables ${\displaystyle \mathbf {X} }$ with real components, the moment-generating function is given by

${\displaystyle M_{X}(\mathbf {t} )=E\left(e^{\langle \mathbf {t} ,\mathbf {X} \rangle }\right)}$

where ${\displaystyle \mathbf {t} }$ is a vector and ${\displaystyle \langle \cdot ,\cdot \rangle }$ is the dot product.

## Important properties

Moment generating functions are positive and log-convex, with M(0) = 1.

An important property of the moment-generating function is that if two distributions have the same moment-generating function, then they are identical at almost all points.[3] That is, if for all values of t,

${\displaystyle M_{X}(t)=M_{Y}(t),\,}$

then

${\displaystyle F_{X}(x)=F_{Y}(x)\,}$

for all values of x (or equivalently X and Y have the same distribution). This statement is not equivalent to the statement "if two distributions have the same moments, then they are identical at all points." This is because in some cases, the moments exist and yet the moment-generating function does not, because the limit

${\displaystyle \lim _{n\rightarrow \infty }\sum _{i=0}^{n}{\frac {t^{i}m_{i}}{i!}}}$

may not exist. The lognormal distribution is an example of when this occurs.

### Calculations of moments

The moment-generating function is so called because if it exists on an open interval around t = 0, then it is the exponential generating function of the moments of the probability distribution:

${\displaystyle m_{n}=E\left(X^{n}\right)=M_{X}^{(n)}(0)=\left.{\frac {d^{n}M_{X}}{dt^{n}}}\right|_{t=0}.}$

That is, with n being a nonnegative integer, the nth moment about 0 is the nth derivative of the moment generating function, evaluated at t = 0.

## Other properties

Jensen's inequality provides a simple lower bound on the moment-generating function:

${\displaystyle M_{X}(t)\geq e^{\mu t},}$

where ${\displaystyle \mu }$ is the mean of X.

Upper bounding the moment-generating function can be used in conjunction with Markov's inequality to bound the upper tail of a real random variable X. This statement is also called the Chernoff bound. Since ${\displaystyle x\mapsto e^{xt}}$ is monotonically increasing for ${\displaystyle t>0}$, we have

${\displaystyle P(X\geq a)=P(e^{tX}\geq e^{ta})\leq e^{-at}E[e^{tX}]=e^{-at}M_{X}(t)}$

for any ${\displaystyle t>0}$ and any a, provided ${\displaystyle M_{X}(t)}$ exists. For example, when X is a standard normal distribution and ${\displaystyle a>0}$, we can choose ${\displaystyle t=a}$ and recall that ${\displaystyle M_{X}(t)=e^{t^{2}/2}}$. This gives ${\displaystyle P(X\geq a)\leq e^{-a^{2}/2}}$, which is within a factor of 1+a of the exact value.

Various lemmas, such as Hoeffding's lemma or Bennett's inequality provide bounds on the moment-generating function in the case of a zero-mean, bounded random variable.

When all moments are non-negative, the moment generating function gives a simple, useful bound on the moments:

${\displaystyle M_{X}(t)\geq {\frac {t^{k}}{k!}}E[X^{k}].}$

This can be extended to non-integer powers ${\displaystyle k}$ by applying the mentioned Chernoff bound and the Law of the unconscious statistician:

{\displaystyle {\begin{aligned}E[X^{k}]&=\int _{0}^{\infty }ka^{k-1}\Pr[X\geq a]\,da\\&\leq \int _{0}^{\infty }ka^{k-1}e^{-at}M_{X}(t)\,da\\&={\frac {\Gamma (k+1)}{t^{k}}}M_{X}(t).\end{aligned}}}

## Relation to other functions

Related to the moment-generating function are a number of other transforms that are common in probability theory:

Characteristic function
The characteristic function ${\displaystyle \varphi _{X}(t)}$ is related to the moment-generating function via ${\displaystyle \varphi _{X}(t)=M_{iX}(t)=M_{X}(it):}$ the characteristic function is the moment-generating function of iX or the moment generating function of X evaluated on the imaginary axis. This function can also be viewed as the Fourier transform of the probability density function, which can therefore be deduced from it by inverse Fourier transform.
Cumulant-generating function
The cumulant-generating function is defined as the logarithm of the moment-generating function; some instead define the cumulant-generating function as the logarithm of the characteristic function, while others call this latter the second cumulant-generating function.
Probability-generating function
The probability-generating function is defined as ${\displaystyle G(z)=E\left[z^{X}\right].\,}$ This immediately implies that ${\displaystyle G(e^{t})=E\left[e^{tX}\right]=M_{X}(t).\,}$

## References

### Citations

1. ^ Bulmer, M. G. (1979). Principles of Statistics. Dover. pp. 75-79. ISBN 0-486-63760-3.
2. ^ Kotz et al.[full ] p. 37 using 1 as the number of degree of freedom to recover the Cauchy distribution
3. ^ Grimmett, Geoffrey (1986). Probability - An Introduction. Oxford University Press. p. 101. ISBN 978-0-19-853264-4.