Exponential Distribution
Get Exponential Distribution essential facts below. View Videos or join the Exponential Distribution discussion. Add Exponential Distribution to your PopFlock.com topic list for future reference or share this resource on social media.
Exponential Distribution
Parameters Probability density function Cumulative distribution function ${\displaystyle \lambda >0,}$ rate, or inverse scale ${\displaystyle x\in [0,\infty )}$ ${\displaystyle \lambda e^{-\lambda x}}$ ${\displaystyle 1-e^{-\lambda x}}$ ${\displaystyle -{\frac {\ln(1-p)}{\lambda }}}$ ${\displaystyle {\frac {1}{\lambda }}}$ ${\displaystyle {\frac {\ln 2}{\lambda }}}$ ${\displaystyle 0}$ ${\displaystyle {\frac {1}{\lambda ^{2}}}}$ ${\displaystyle 2}$ ${\displaystyle 6}$ ${\displaystyle 1-\ln \lambda }$ ${\displaystyle {\frac {\lambda }{\lambda -t}},{\text{ for }}t<\lambda }$ ${\displaystyle {\frac {\lambda }{\lambda -it}}}$ ${\displaystyle {\frac {1}{\lambda ^{2}}}}$ ${\displaystyle \ln {\frac {\lambda _{0}}{\lambda }}+{\frac {\lambda }{\lambda _{0}}}-1}$

In probability theory and statistics, the exponential distribution is the probability distribution of the time between events in a Poisson point process, i.e., a process in which events occur continuously and independently at a constant average rate. It is a particular case of the gamma distribution. It is the continuous analogue of the geometric distribution, and it has the key property of being memoryless. In addition to being used for the analysis of Poisson point processes it is found in various other contexts.

The exponential distribution is not the same as the class of exponential families of distributions, which is a large class of probability distributions that includes the exponential distribution as one of its members, but also includes the normal distribution, binomial distribution, gamma distribution, Poisson, and many others.

## Definitions

### Probability density function

The probability density function (pdf) of an exponential distribution is

${\displaystyle f(x;\lambda )={\begin{cases}\lambda e^{-\lambda x}&x\geq 0,\\0&x<0.\end{cases}}}$

Here ? > 0 is the parameter of the distribution, often called the rate parameter. The distribution is supported on the interval [0, ?). If a random variable X has this distribution, we write X ~ Exp(?).

The exponential distribution exhibits infinite divisibility.

### Cumulative distribution function

The cumulative distribution function is given by

${\displaystyle F(x;\lambda )={\begin{cases}1-e^{-(\lambda x)}&x\geq 0,\\0&x<0.\end{cases}}}$

### Alternative parametrization

The exponential distribution is sometimes parametrized in terms of the scale parameter β = 1/λ:

${\displaystyle f(x;\beta )={\begin{cases}{\frac {1}{\beta }}e^{-x/\beta }&x\geq 0,\\0&x<0.\end{cases}}}$

## Properties

### Mean, variance, moments and median

The mean is the probability mass centre, that is the first moment.
The median is the preimage F-1(1/2).

The mean or expected value of an exponentially distributed random variable X with rate parameter ? is given by

${\displaystyle \operatorname {E} [X]={\frac {1}{\lambda }}.}$

In light of the examples given below, this makes sense: if you receive phone calls at an average rate of 2 per hour, then you can expect to wait half an hour for every call.

The variance of X is given by

${\displaystyle \operatorname {Var} [X]={\frac {1}{\lambda ^{2}}},}$

so the standard deviation is equal to the mean.

The moments of X, for ${\displaystyle n\in \mathbb {N} }$ are given by

${\displaystyle \operatorname {E} \left[X^{n}\right]={\frac {n!}{\lambda ^{n}}}.}$

The central moments of X, for ${\displaystyle n\in \mathbb {N} }$ are given by

${\displaystyle \mu _{n}={\frac {!n}{\lambda ^{n}}}={\frac {n!}{\lambda ^{n}}}\sum _{k=0}^{n}{\frac {(-1)^{k}}{k!}}.}$

where !n is the subfactorial of n

The median of X is given by

${\displaystyle \operatorname {m} [X]={\frac {\ln(2)}{\lambda }}<\operatorname {E} [X],}$

where ln refers to the natural logarithm. Thus the absolute difference between the mean and median is

${\displaystyle \left|\operatorname {E} \left[X\right]-\operatorname {m} \left[X\right]\right|={\frac {1-\ln(2)}{\lambda }}<{\frac {1}{\lambda }}=\operatorname {\sigma } [X],}$

in accordance with the median-mean inequality.

### Memorylessness

An exponentially distributed random variable T obeys the relation

${\displaystyle \Pr \left(T>s+t\mid T>s\right)=\Pr(T>t),\qquad \forall s,t\geq 0.}$

This can be seen by considering the complementary cumulative distribution function:

{\displaystyle {\begin{aligned}\Pr \left(T>s+t\mid T>s\right)&={\frac {\Pr \left(T>s+t\cap T>s\right)}{\Pr \left(T>s\right)}}\\[4pt]&={\frac {\Pr \left(T>s+t\right)}{\Pr \left(T>s\right)}}\\[4pt]&={\frac {e^{-\lambda (s+t)}}{e^{-\lambda s}}}\\[4pt]&=e^{-\lambda t}\\[4pt]&=\Pr(T>t).\end{aligned}}}

When T is interpreted as the waiting time for an event to occur relative to some initial time, this relation implies that, if T is conditioned on a failure to observe the event over some initial period of time s, the distribution of the remaining waiting time is the same as the original unconditional distribution. For example, if an event has not occurred after 30 seconds, the conditional probability that occurrence will take at least 10 more seconds is equal to the unconditional probability of observing the event more than 10 seconds after the initial time.

The exponential distribution and the geometric distribution are the only memoryless probability distributions.

The exponential distribution is consequently also necessarily the only continuous probability distribution that has a constant failure rate.

### Quantiles

Tukey criteria for anomalies.[]

The quantile function (inverse cumulative distribution function) for Exp(?) is

${\displaystyle F^{-1}(p;\lambda )={\frac {-\ln(1-p)}{\lambda }},\qquad 0\leq p<1}$

The quartiles are therefore:

• first quartile: ln(4/3)/?
• median: ln(2)/?
• third quartile: ln(4)/?

And as a consequence the interquartile range is ln(3)/?.

### Kullback-Leibler divergence

The directed Kullback-Leibler divergence in nats of ${\displaystyle e^{\lambda }}$ ("approximating" distribution) from ${\displaystyle e^{\lambda _{0}}}$ ('true' distribution) is given by

{\displaystyle {\begin{aligned}\Delta (\lambda _{0}\parallel \lambda )&=\mathbb {E} _{\lambda _{0}}\left(\log {\frac {p_{\lambda _{0}}(x)}{p_{\lambda }(x)}}\right)\\&=\mathbb {E} _{\lambda _{0}}\left(\log {\frac {\lambda _{0}e^{-\lambda _{0}x}}{\lambda e^{-\lambda x}}}\right)\\&=\log(\lambda _{0})-\log(\lambda )-(\lambda _{0}-\lambda )E_{\lambda _{0}}(x)\\&=\log(\lambda _{0})-\log(\lambda )+{\frac {\lambda }{\lambda _{0}}}-1.\end{aligned}}}

### Maximum entropy distribution

Among all continuous probability distributions with support [0, ∞) and mean ?, the exponential distribution with λ = 1/? has the largest differential entropy. In other words, it is the maximum entropy probability distribution for a random variate X which is greater than or equal to zero and for which E[X] is fixed.[1]

### Distribution of the minimum of exponential random variables

Let X1, ..., Xn be independent exponentially distributed random variables with rate parameters ?1, ..., ?n. Then

${\displaystyle \min \left\{X_{1},\dotsc ,X_{n}\right\}}$

is also exponentially distributed, with parameter

${\displaystyle \lambda =\lambda _{1}+\dotsb +\lambda _{n}.}$

This can be seen by considering the complementary cumulative distribution function:

{\displaystyle {\begin{aligned}&\Pr \left(\min\{X_{1},\dotsc ,X_{n}\}>x\right)\\={}&\Pr \left(X_{1}>x,\dotsc ,X_{n}>x\right)\\={}&\prod _{i=1}^{n}\Pr \left(X_{i}>x\right)\\={}&\prod _{i=1}^{n}\exp \left(-x\lambda _{i}\right)=\exp \left(-x\sum _{i=1}^{n}\lambda _{i}\right).\end{aligned}}}

The index of the variable which achieves the minimum is distributed according to the categorical distribution

${\displaystyle \Pr \left(k\mid X_{k}=\min\{X_{1},\dotsc ,X_{n}\}\right)={\frac {\lambda _{k}}{\lambda _{1}+\dotsb +\lambda _{n}}}.}$

A proof is as follows:

${\displaystyle {\text{Let }}I=\operatorname {argmin} _{i\in \{1,\dotsb ,n\}}\{X_{1},\dotsc ,X_{n}\}}$
{\displaystyle {\begin{aligned}{\text{then }}\Pr(I=k)&=\int _{0}^{\infty }\Pr(X_{k}=x)\Pr(X_{i\neq k}>x)dx\\&=\int _{0}^{\infty }\lambda _{k}e^{-\lambda _{k}x}\left(\prod _{i=1,i\neq k}^{n}e^{-\lambda _{i}x}\right)dx\\&=\lambda _{k}\int _{0}^{\infty }e^{-\left(\lambda _{1}+\dotsb +\lambda _{n}\right)x}dx\\&={\frac {\lambda _{k}}{\lambda _{1}+\dotsb +\lambda _{n}}}.\end{aligned}}}

Note that

${\displaystyle \max\{X_{1},\dotsc ,X_{n}\}}$

is not exponentially distributed.[2]

### Joint moments of i.i.d. exponential order statistics

Let ${\displaystyle X_{1},\dotsc ,X_{n}}$ be ${\displaystyle n}$ independent and identically distributed exponential random variables with rate parameter ?. Let ${\displaystyle X_{(1)},\dotsc ,X_{(n)}}$ denote the corresponding order statistics. For ${\displaystyle i , the joint moment ${\displaystyle \operatorname {E} \left[X_{(i)}X_{(j)}\right]}$ of the order statistics ${\displaystyle X_{(i)}}$ and ${\displaystyle X_{(j)}}$ is given by

{\displaystyle {\begin{aligned}\operatorname {E} \left[X_{(i)}X_{(j)}\right]&=\sum _{k=0}^{j-1}{\frac {1}{(n-k)\lambda }}\operatorname {E} \left[X_{(i)}\right]+\operatorname {E} \left[X_{(i)}^{2}\right]\\&=\sum _{k=0}^{j-1}{\frac {1}{(n-k)\lambda }}\sum _{k=0}^{i-1}{\frac {1}{(n-k)\lambda }}+\sum _{k=0}^{i-1}{\frac {1}{((n-k)\lambda )^{2}}}+\left(\sum _{k=0}^{i-1}{\frac {1}{(n-k)\lambda }}\right)^{2}.\end{aligned}}}

This can be seen by invoking the law of total expectation and the memoryless property:

{\displaystyle {\begin{aligned}\operatorname {E} \left[X_{(i)}X_{(j)}\right]&=\int _{0}^{\infty }\operatorname {E} \left[X_{(i)}X_{(j)}\mid X_{(i)}=x\right]f_{X_{(i)}}(x)\,dx\\&=\int _{x=0}^{\infty }x\operatorname {E} \left[X_{(j)}\mid X_{(j)}\geq x\right]f_{X_{(i)}}(x)\,dx&&\left({\textrm {since}}~X_{(i)}=x\implies X_{(j)}\geq x\right)\\&=\int _{x=0}^{\infty }x\left[\operatorname {E} \left[X_{(j)}\right]+x\right]f_{X_{(i)}}(x)\,dx&&\left({\text{by the memoryless property}}\right)\\&=\sum _{k=0}^{j-1}{\frac {1}{(n-k)\lambda }}\operatorname {E} \left[X_{(i)}\right]+\operatorname {E} \left[X_{(i)}^{2}\right].\end{aligned}}}

The first equation follows from the law of total expectation. The second equation exploits the fact that once we condition on ${\displaystyle X_{(i)}=x}$, it must follow that ${\displaystyle X_{(j)}\geq x}$. The third equation relies on the memoryless property to replace ${\displaystyle \operatorname {E} \left[X_{(j)}\mid X_{(j)}\geq x\right]}$ with ${\displaystyle \operatorname {E} \left[X_{(j)}\right]+x}$.

### Sum of two independent exponential random variables

The probability distribution function (PDF) of a sum of two independent random variables is the convolution of their individual PDFs. If ${\displaystyle X_{1}}$ and ${\displaystyle X_{2}}$ are independent exponential random variables with respective rate parameters ${\displaystyle \lambda _{1}}$ and ${\displaystyle \lambda _{2},}$ then the probability density of ${\displaystyle Z=X_{1}+X_{2}}$ is given by

{\displaystyle {\begin{aligned}f_{Z}(z)&=\int _{-\infty }^{\infty }f_{X_{1}}(x_{1})f_{X_{2}}(z-x_{1})\,dx_{1}\\&=\int _{0}^{z}\lambda _{1}e^{-\lambda _{1}x_{1}}\lambda _{2}e^{-\lambda _{2}(z-x_{1})}\,dx_{1}\\&=\lambda _{1}\lambda _{2}e^{-\lambda _{2}z}\int _{0}^{z}e^{(\lambda _{2}-\lambda _{1})x_{1}}\,dx_{1}\\&={\begin{cases}{\dfrac {\lambda _{1}\lambda _{2}}{\lambda _{2}-\lambda _{1}}}\left(e^{-\lambda _{1}z}-e^{-\lambda _{2}z}\right)&{\text{ if }}\lambda _{1}\neq \lambda _{2}\\[4pt]\lambda ^{2}ze^{-\lambda z}&{\text{ if }}\lambda _{1}=\lambda _{2}=\lambda .\end{cases}}\end{aligned}}}

The entropy of this distribution is available in closed form: assuming ${\displaystyle \lambda _{1}>\lambda _{2}}$ (without loss of generality), then

{\displaystyle {\begin{aligned}H(Z)&=1+\gamma +\ln \left({\frac {\lambda _{1}-\lambda _{2}}{\lambda _{1}\lambda _{2}}}\right)+\psi \left({\frac {\lambda _{1}}{\lambda _{1}-\lambda _{2}}}\right),\end{aligned}}}

where ${\displaystyle \gamma }$ is the Euler-Mascheroni constant, and ${\displaystyle \psi (\cdot )}$ is the digamma function.[3]

In the case of equal rate parameters, the result is an Erlang distribution with shape 2 and parameter ${\displaystyle \lambda ,}$ which in turn is a special case of gamma distribution.

## Related distributions

• If ${\displaystyle X\sim \operatorname {Laplace} \left(\mu ,\beta ^{-1}\right)}$ then |X - ?| ~ Exp(?).
• If X ~ Pareto(1, ?) then log(X) ~ Exp(?).
• If X ~ SkewLogistic(?), then ${\displaystyle \log \left(1+e^{-X}\right)\sim \operatorname {Exp} (\theta )}$.
• If Xi ~ U(0, 1) then
${\displaystyle \lim _{n\to \infty }n\min \left(X_{1},\ldots ,X_{n}\right)\sim \operatorname {Exp} (1)}$
• The exponential distribution is a limit of a scaled beta distribution:
${\displaystyle \lim _{n\to \infty }n\operatorname {Beta} (1,n)=\operatorname {Exp} (1).}$
• Exponential distribution is a special case of type 3 Pearson distribution.
• If X ~ Exp(?) and Xi ~ Exp(?i) then:
• ${\displaystyle kX\sim \operatorname {Exp} \left({\frac {\lambda }{k}}\right)}$, closure under scaling by a positive factor.
• 1 + X ~ BenktanderWeibull(?, 1), which reduces to a truncated exponential distribution.
• keX ~ Pareto(k, ?).
• e-X ~ Beta(?, 1).
• eX ~ PowerLaw(k, ?)
• ${\displaystyle {\sqrt {X}}\sim \operatorname {Rayleigh} \left({\frac {1}{\sqrt {2\lambda }}}\right)}$, the Rayleigh distribution
• ${\displaystyle X\sim \operatorname {Weibull} \left({\frac {1}{\lambda }},1\right)}$, the Weibull distribution
• ${\displaystyle X^{2}\sim \operatorname {Weibull} \left({\frac {1}{\lambda ^{2}}},{\frac {1}{2}}\right)}$
• .
• If also Y ~ Erlang(n, ?) or${\displaystyle Y\sim \Gamma \left(n,{\frac {1}{\lambda }}\right)}$ then ${\displaystyle {\frac {X}{Y}}+1\sim \operatorname {Pareto} (1,n)}$
• If also ? ~ Gamma(k, ?) (shape, scale parametrisation) then the marginal distribution of X is Lomax(k, 1/?), the gamma mixture
• ?1X1 - ?2Y2 ~ Laplace(0, 1).
• min{X1, ..., Xn} ~ Exp(?1 + ... + ?n).
• If also ?i = ? then:
• ${\displaystyle X_{1}+\cdots +X_{k}=\sum _{i}X_{i}\sim }$ Erlang(k, ?) = Gamma(k, ?-1) = Gamma(k, ?) (in (k, ?) and (?, ?) parametrization, respectively) with an integer shape parameter k.
• Xi - Xj ~ Laplace(0, ?-1).
• If also Xi are independent, then:
• ${\displaystyle {\frac {X_{i}}{X_{i}+X_{j}}}}$ ~ U(0, 1)
• ${\displaystyle Z={\frac {\lambda _{i}X_{i}}{\lambda _{j}X_{j}}}}$ has probability density function ${\displaystyle f_{Z}(z)={\frac {1}{(z+1)^{2}}}}$. This can be used to obtain a confidence interval for ${\displaystyle {\frac {\lambda _{i}}{\lambda _{j}}}}$.
• If also ? = 1:
• ${\displaystyle \mu -\beta \log \left({\frac {e^{-X}}{1-e^{-X}}}\right)\sim \operatorname {Logistic} (\mu ,\beta )}$, the logistic distribution
• ${\displaystyle \mu -\beta \log \left({\frac {X_{i}}{X_{j}}}\right)\sim \operatorname {Logistic} (\mu ,\beta )}$
• ? - ? log(X) ~ GEV(?, ?, 0).
• Further if ${\displaystyle Y\sim \Gamma \left(\alpha ,{\frac {\beta }{\alpha }}\right)}$ then ${\displaystyle {\sqrt {XY}}\sim \operatorname {K} (\alpha ,\beta )}$ (K-distribution)
• If also ? = 1/2 then ; i.e., X has a chi-squared distribution with 2 degrees of freedom. Hence:
${\displaystyle \operatorname {Exp} (\lambda )={\frac {1}{2\lambda }}\operatorname {Exp} \left({\frac {1}{2}}\right)\sim {\frac {1}{2\lambda }}\chi _{2}^{2}\Rightarrow \sum _{i=1}^{n}\operatorname {Exp} (\lambda )\sim {\frac {1}{2\lambda }}\chi _{2n}^{2}}$
• If ${\displaystyle X\sim \operatorname {Exp} \left({\frac {1}{\lambda }}\right)}$ and ${\displaystyle Y\mid X}$ ~ Poisson(X) then ${\displaystyle Y\sim \operatorname {Geometric} \left({\frac {1}{1+\lambda }}\right)}$ (geometric distribution)
• The Hoyt distribution can be obtained from exponential distribution and arcsine distribution

Other related distributions:

## Statistical inference

Below, suppose random variable X is exponentially distributed with rate parameter ?, and ${\displaystyle x_{1},\dotsc ,x_{n}}$ are n independent samples from X, with sample mean ${\displaystyle {\bar {x}}}$.

### Parameter estimation

The maximum likelihood estimator for ? is constructed as follows:

The likelihood function for ?, given an independent and identically distributed sample x = (x1, ..., xn) drawn from the variable, is:

${\displaystyle L(\lambda )=\prod _{i=1}^{n}\lambda \exp(-\lambda x_{i})=\lambda ^{n}\exp \left(-\lambda \sum _{i=1}^{n}x_{i}\right)=\lambda ^{n}\exp \left(-\lambda n{\overline {x}}\right),}$

where:

${\displaystyle {\overline {x}}={\frac {1}{n}}\sum _{i=1}^{n}x_{i}}$

is the sample mean.

The derivative of the likelihood function's logarithm is:

${\displaystyle {\frac {d}{d\lambda }}\ln L(\lambda )={\frac {d}{d\lambda }}\left(n\ln \lambda -\lambda n{\overline {x}}\right)={\frac {n}{\lambda }}-n{\overline {x}}\ {\begin{cases}>0,&0<\lambda <{\frac {1}{\overline {x}}},\\[8pt]=0,&\lambda ={\frac {1}{\overline {x}}},\\[8pt]<0,&\lambda >{\frac {1}{\overline {x}}}.\end{cases}}}$

Consequently, the maximum likelihood estimate for the rate parameter is:

${\displaystyle {\widehat {\lambda }}={\frac {1}{\overline {x}}}={\frac {n}{\sum _{i}x_{i}}}}$

This is not an unbiased estimator of ${\displaystyle \lambda ,}$ although ${\displaystyle {\overline {x}}}$ is an unbiased[4] MLE[5] estimator of ${\displaystyle 1/\lambda }$ and the distribution mean.

The bias of ${\displaystyle {\widehat {\lambda }}_{\text{mle}}}$ is equal to

${\displaystyle b\equiv \operatorname {E} \left[\left({\widehat {\lambda }}_{\text{mle}}-\lambda \right)\right]={\frac {\lambda }{n-1}}}$

which yields the bias-corrected maximum likelihood estimator

${\displaystyle {\widehat {\lambda }}_{\text{mle}}^{*}={\widehat {\lambda }}_{\text{mle}}-{\widehat {b}}.}$

### Approximate minimizer of expected squared error

Assume you have at least three samples. If we seek a minimizer of expected mean squared error (see also: Bias-variance tradeoff) that is similar to the maximum likelihood estimate (i.e. a multiplicative correction to the likelihood estimate) we have:

${\displaystyle {\widehat {\lambda }}=\left({\frac {n-2}{n}}\right)\left({\frac {1}{\bar {x}}}\right)={\frac {n-2}{\sum _{i}x_{i}}}}$

This is derived from the mean and variance of the inverse-gamma distribution: ${\textstyle {\mbox{Inv-Gamma}}(n,\lambda )}$.[6]

### Fisher information

The Fisher information, denoted ${\displaystyle {\mathcal {I}}(\lambda )}$, for an estimator of the rate parameter ${\displaystyle \lambda }$ is given as:

${\displaystyle {\mathcal {I}}(\lambda )=\operatorname {E} \left[\left.\left({\frac {\partial }{\partial \lambda }}\log f(x;\lambda )\right)^{2}\right|\lambda \right]=\int \left({\frac {\partial }{\partial \lambda }}\log f(x;\lambda )\right)^{2}f(x;\lambda )\,dx}$

Plugging in the distribution and solving gives:

${\displaystyle {\mathcal {I}}(\lambda )=\int _{0}^{\infty }\left({\frac {\partial }{\partial \lambda }}\log \lambda e^{-\lambda x}\right)^{2}\lambda e^{-\lambda x}\,dx=\int _{0}^{\infty }\left({\frac {1}{\lambda }}-x\right)^{2}\lambda e^{-\lambda x}\,dx=\lambda ^{-2}.}$

This determines the amount of information each independent sample of an exponential distribution carries about the unknown rate parameter ${\displaystyle \lambda }$.

### Confidence intervals

The 100(1 - ?)% confidence interval for the rate parameter of an exponential distribution is given by:[7]

${\displaystyle {\frac {2n}{{\widehat {\lambda }}\chi _{1-{\frac {\alpha }{2}},2n}^{2}}}<{\frac {1}{\lambda }}<{\frac {2n}{{\widehat {\lambda }}\chi _{{\frac {\alpha }{2}},2n}^{2}}}}$

which is also equal to:

${\displaystyle {\frac {2n{\overline {x}}}{\chi _{1-{\frac {\alpha }{2}},2n}^{2}}}<{\frac {1}{\lambda }}<{\frac {2n{\overline {x}}}{\chi _{{\frac {\alpha }{2}},2n}^{2}}}}$

where ?2
p,v
is the 100(p) percentile of the chi squared distribution with v degrees of freedom, n is the number of observations of inter-arrival times in the sample, and x-bar is the sample average. A simple approximation to the exact interval endpoints can be derived using a normal approximation to the ?2
p,v
distribution. This approximation gives the following values for a 95% confidence interval:

{\displaystyle {\begin{aligned}\lambda _{\text{lower}}&={\widehat {\lambda }}\left(1-{\frac {1.96}{\sqrt {n}}}\right)\\\lambda _{\text{upper}}&={\widehat {\lambda }}\left(1+{\frac {1.96}{\sqrt {n}}}\right)\end{aligned}}}

This approximation may be acceptable for samples containing at least 15 to 20 elements.[8]

### Bayesian inference

The conjugate prior for the exponential distribution is the gamma distribution (of which the exponential distribution is a special case). The following parameterization of the gamma probability density function is useful:

${\displaystyle \operatorname {Gamma} (\lambda ;\alpha ,\beta )={\frac {\beta ^{\alpha }}{\Gamma (\alpha )}}\lambda ^{\alpha -1}\exp(-\lambda \beta ).}$

The posterior distribution p can then be expressed in terms of the likelihood function defined above and a gamma prior:

{\displaystyle {\begin{aligned}p(\lambda )&\propto L(\lambda )\Gamma (\lambda ;\alpha ,\beta )\\&=\lambda ^{n}\exp \left(-\lambda n{\overline {x}}\right){\frac {\beta ^{\alpha }}{\Gamma (\alpha )}}\lambda ^{\alpha -1}\exp(-\lambda \beta )\\&\propto \lambda ^{(\alpha +n)-1}\exp(-\lambda \left(\beta +n{\overline {x}}\right)).\end{aligned}}}

Now the posterior density p has been specified up to a missing normalizing constant. Since it has the form of a gamma pdf, this can easily be filled in, and one obtains:

${\displaystyle p(\lambda )=\Gamma (\lambda ;\alpha +n,\beta +n{\overline {x}}).}$

Here the hyperparameter ? can be interpreted as the number of prior observations, and ? as the sum of the prior observations. The posterior mean here is:

${\displaystyle {\frac {\alpha +n}{\beta +n{\overline {x}}}}.}$

## Occurrence and applications

### Occurrence of events

The exponential distribution occurs naturally when describing the lengths of the inter-arrival times in a homogeneous Poisson process.

The exponential distribution may be viewed as a continuous counterpart of the geometric distribution, which describes the number of Bernoulli trials necessary for a discrete process to change state. In contrast, the exponential distribution describes the time for a continuous process to change state.

In real-world scenarios, the assumption of a constant rate (or probability per unit time) is rarely satisfied. For example, the rate of incoming phone calls differs according to the time of day. But if we focus on a time interval during which the rate is roughly constant, such as from 2 to 4 p.m. during work days, the exponential distribution can be used as a good approximate model for the time until the next phone call arrives. Similar caveats apply to the following examples which yield approximately exponentially distributed variables:

• The time until a radioactive particle decays, or the time between clicks of a Geiger counter
• The time it takes before your next telephone call
• The time until default (on payment to company debt holders) in reduced form credit risk modeling

Exponential variables can also be used to model situations where certain events occur with a constant probability per unit length, such as the distance between mutations on a DNA strand, or between roadkills on a given road.

In queuing theory, the service times of agents in a system (e.g. how long it takes for a bank teller etc. to serve a customer) are often modeled as exponentially distributed variables. (The arrival of customers for instance is also modeled by the Poisson distribution if the arrivals are independent and distributed identically.) The length of a process that can be thought of as a sequence of several independent tasks follows the Erlang distribution (which is the distribution of the sum of several independent exponentially distributed variables). Reliability theory and reliability engineering also make extensive use of the exponential distribution. Because of the memoryless property of this distribution, it is well-suited to model the constant hazard rate portion of the bathtub curve used in reliability theory. It is also very convenient because it is so easy to add failure rates in a reliability model. The exponential distribution is however not appropriate to model the overall lifetime of organisms or technical devices, because the "failure rates" here are not constant: more failures occur for very young and for very old systems.

Fitted cumulative exponential distribution to annually maximum 1-day rainfalls using CumFreq[9]

In physics, if you observe a gas at a fixed temperature and pressure in a uniform gravitational field, the heights of the various molecules also follow an approximate exponential distribution, known as the Barometric formula. This is a consequence of the entropy property mentioned below.

In hydrology, the exponential distribution is used to analyze extreme values of such variables as monthly and annual maximum values of daily rainfall and river discharge volumes.[10]

The blue picture illustrates an example of fitting the exponential distribution to ranked annually maximum one-day rainfalls showing also the 90% confidence belt based on the binomial distribution. The rainfall data are represented by plotting positions as part of the cumulative frequency analysis.

### Prediction

Having observed a sample of n data points from an unknown exponential distribution a common task is to use these samples to make predictions about future data from the same source. A common predictive distribution over future samples is the so-called plug-in distribution, formed by plugging a suitable estimate for the rate parameter ? into the exponential density function. A common choice of estimate is the one provided by the principle of maximum likelihood, and using this yields the predictive density over a future sample xn+1, conditioned on the observed samples x = (x1, ..., xn) given by

${\displaystyle p_{\rm {ML}}(x_{n+1}\mid x_{1},\ldots ,x_{n})=\left({\frac {1}{\overline {x}}}\right)\exp \left(-{\frac {x_{n+1}}{\overline {x}}}\right)}$

The Bayesian approach provides a predictive distribution which takes into account the uncertainty of the estimated parameter, although this may depend crucially on the choice of prior.

A predictive distribution free of the issues of choosing priors that arise under the subjective Bayesian approach is

${\displaystyle p_{\rm {CNML}}(x_{n+1}\mid x_{1},\ldots ,x_{n})={\frac {n^{n+1}\left({\overline {x}}\right)^{n}}{\left(n{\overline {x}}+x_{n+1}\right)^{n+1}}},}$

which can be considered as

1. a frequentist confidence distribution, obtained from the distribution of the pivotal quantity ${\displaystyle {x_{n+1}}/{\overline {x}}}$;[11]
2. a profile predictive likelihood, obtained by eliminating the parameter ? from the joint likelihood of xn+1 and ? by maximization;[12]
3. an objective Bayesian predictive posterior distribution, obtained using the non-informative Jeffreys prior 1/?;
4. the Conditional Normalized Maximum Likelihood (CNML) predictive distribution, from information theoretic considerations.[13]

The accuracy of a predictive distribution may be measured using the distance or divergence between the true exponential distribution with rate parameter, ?0, and the predictive distribution based on the sample x. The Kullback-Leibler divergence is a commonly used, parameterisation free measure of the difference between two distributions. Letting ?(?0||p) denote the Kullback-Leibler divergence between an exponential with rate parameter ?0 and a predictive distribution p it can be shown that

{\displaystyle {\begin{aligned}\operatorname {E} _{\lambda _{0}}\left[\Delta (\lambda _{0}\parallel p_{\rm {ML}})\right]&=\psi (n)+{\frac {1}{n-1}}-\log(n)\\\operatorname {E} _{\lambda _{0}}\left[\Delta (\lambda _{0}\parallel p_{\rm {CNML}})\right]&=\psi (n)+{\frac {1}{n}}-\log(n)\end{aligned}}}

where the expectation is taken with respect to the exponential distribution with rate parameter , and is the digamma function. It is clear that the CNML predictive distribution is strictly superior to the maximum likelihood plug-in distribution in terms of average Kullback-Leibler divergence for all sample sizes .

## Computational methods

### Generating exponential variates

A conceptually very simple method for generating exponential variates is based on inverse transform sampling: Given a random variate U drawn from the uniform distribution on the unit interval (0, 1), the variate

${\displaystyle T=F^{-1}(U)}$

has an exponential distribution, where F -1 is the quantile function, defined by

${\displaystyle F^{-1}(p)={\frac {-\ln(1-p)}{\lambda }}.}$

Moreover, if U is uniform on (0, 1), then so is 1 - U. This means one can generate exponential variates as follows:

${\displaystyle T={\frac {-\ln(U)}{\lambda }}.}$

Other methods for generating exponential variates are discussed by Knuth[14] and Devroye.[15]

A fast method for generating a set of ready-ordered exponential variates without using a sorting routine is also available.[15]

## References

1. ^ Park, Sung Y.; Bera, Anil K. (2009). "Maximum entropy autoregressive conditional heteroskedasticity model" (PDF). Journal of Econometrics. Elsevier: 219-230. Archived from the original (PDF) on 2016-03-07. Retrieved .
2. ^ Michael, Lugo. "The expectation of the maximum of exponentials" (PDF). Archived from the original (PDF) on 20 December 2016. Retrieved 2016.
3. ^ Eckford, Andrew W.; Thomas, Peter J. (2016). "Entropy of the sum of two independent, non-identically-distributed exponential random variables". arXiv:1609.02911.
4. ^ Richard Arnold Johnson; Dean W. Wichern (2007). Applied Multivariate Statistical Analysis. Pearson Prentice Hall. ISBN 978-0-13-187715-3. Retrieved 2012.
5. ^ NIST/SEMATECH e-Handbook of Statistical Methods
6. ^ Elfessi, Abdulaziz; Reineke, David M. (2001). "A Bayesian Look at Classical Estimation: The Exponential Distribution". Journal of Statistics Education. 9 (1). doi:10.1080/10691898.2001.11910648.
7. ^ Ross, Sheldon M. (2009). Introduction to probability and statistics for engineers and scientists (4th ed.). Associated Press. p. 267. ISBN 978-0-12-370483-2.
8. ^ Guerriero, V. (2012). "Power Law Distribution: Method of Multi-scale Inferential Statistics". Journal of Modern Mathematics Frontier (JMMF). 1: 21-28.
9. ^
10. ^ Ritzema (ed.), H.P. (1994). Frequency and Regression Analysis. Chapter 6 in: Drainage Principles and Applications, Publication 16, International Institute for Land Reclamation and Improvement (ILRI), Wageningen, The Netherlands. pp. 175-224. ISBN 90-70754-33-9.CS1 maint: extra text: authors list (link)
11. ^ Lawless, J. F.; Fredette, M. (2005). "Frequentist predictions intervals and predictive distributions". Biometrika. 92 (3): 529-542. doi:10.1093/biomet/92.3.529.
12. ^ Bjornstad, J.F. (1990). "Predictive Likelihood: A Review". Statist. Sci. 5 (2): 242-254. doi:10.1214/ss/1177012175.
13. ^ D. F. Schmidt and E. Makalic, "Universal Models for the Exponential Distribution", IEEE Transactions on Information Theory, Volume 55, Number 7, pp. 3087-3090, 2009 doi:10.1109/TIT.2009.2018331
14. ^ Donald E. Knuth (1998). The Art of Computer Programming, volume 2: Seminumerical Algorithms, 3rd edn. Boston: Addison-Wesley. ISBN 0-201-89684-2. See section 3.4.1, p. 133.
15. ^ a b Luc Devroye (1986). Non-Uniform Random Variate Generation. New York: Springer-Verlag. ISBN 0-387-96305-7. See chapter IX, section 2, pp. 392-401.