Erlang distribution

From testwiki-math
Jump to: navigation, search

Template:Probability distribution The Erlang distribution is a continuous probability distribution with wide applicability primarily due to its relation to the exponential and Gamma distributions. The Erlang distribution was developed by A. K. Erlang to examine the number of telephone calls which might be made at the same time to the operators of the switching stations. This work on telephone traffic engineering has been expanded to consider waiting times in queueing systems in general. The distribution is now used in the fields of stochastic processes and of biomathematics.

Contents

Overview

The distribution is a continuous distribution, which has a positive value for all real numbers greater than zero, and is given by two parameters: the shape k k k , which is a non-negative integer, and the rate λ λ \lambda , which is a non-negative real number. The distribution is sometimes defined using the inverse of the rate parameter, the scale μ μ \mu . It is the distribution of the sum of k k k independent exponential variables with mean μ μ \mu .

When the shape parameter k k k equals 1, the distribution simplifies to the exponential distribution. The Erlang distribution is a special case of the Gamma distribution where the shape parameter k k k is an integer. In the Gamma distribution, this parameter is not restricted to the integers.

Characterization

Probability density function

The probability density function of the Erlang distribution is

f ( x ; k , λ ) = λ k x k - 1 e - λ x ( k - 1 ) ! for  x , λ 0 formulae-sequence f x k λ superscript λ k superscript x k 1 superscript e λ x k 1 for x λ 0 f(x;k,\lambda)={\lambda^{k}x^{{k-1}}e^{{-\lambda x}}\over(k-1)!}\quad\mbox{for% }x,\lambda\geq 0
The parameter k k k is called the shape parameter and the parameter λ λ \lambda is called the rate parameter. An alternative, but equivalent, parametrization uses the scale parameter μ μ \mu which is the reciprocal of the rate parameter (i.e., μ = 1 / λ μ 1 λ \mu=1/\lambda ):
f ( x ; k , μ ) = x k - 1 e - x μ μ k ( k - 1 ) ! for  x , μ 0 formulae-sequence f x k μ superscript x k 1 superscript e x μ superscript μ k k 1 for x μ 0 f(x;k,\mu)=\frac{x^{{k-1}}e^{{-\frac{x}{\mu}}}}{\mu^{k}(k-1)!}\quad\mbox{for }% x,\mu\geq 0

When the scale parameter μ μ \mu equals 2, then distribution simplifies to the chi-squared distribution with 2k degrees of freedom. It can therefore be regarded as a generalized chi-squared distribution.

Because of the factorial function in the denominator, the Erlang distribution is only defined when the parameter k is a positive integer. In fact, this distribution is sometimes called the Erlang-k distribution (e.g., an Erlang-2 distribution is an Erlang distribution with k=2). The Gamma distribution generalizes the Erlang by allowing k k k to be any real number, using the gamma function instead of the factorial function.

Cumulative distribution function (CDF)

The cumulative distribution function of the Erlang distribution is:

F ( x ; k , λ ) = γ ( k , λ x ) ( k - 1 ) ! F x k λ γ k λ x k 1 F(x;k,\lambda)=\frac{\gamma(k,\lambda x)}{(k-1)!}

where γ ( ) γ FENCED \gamma() is the lower incomplete gamma function. The CDF may also be expressed as

F ( x ; k , λ ) = 1 - n = 0 k - 1 1 n ! e - λ x ( λ x ) n F x k λ 1 superscript subscript n 0 k 1 1 n superscript e λ x superscript λ x n F(x;k,\lambda)=1-\sum_{{n=0}}^{{k-1}}\frac{1}{n!}e^{{-\lambda x}}(\lambda x)^{% {n}}

Occurrence

Waiting times

Events that occur independently with some average rate are modeled with a Poisson process. The waiting times between k occurrences of the event are Erlang distributed. (The related question of the number of events in a given amount of time is described by the Poisson distribution.)

The Erlang distribution, which measures the time between incoming calls, can be used in conjunction with the expected duration of incoming calls to produce information about the traffic load measured in Erlang units. This can be used to determine the probability of packet loss or delay, according to various assumptions made about whether blocked calls are aborted (Erlang B formula) or queued until served (Erlang C formula). The Erlang-B and C formulae are still in everyday use for traffic modeling for applications such as the design of call centers.


A.K. Erlang worked a lot in traffic modeling. There are thus two other Erlang distributions, both used in modeling traffic:

Erlang B distribution: this is the easier of the two, and can be used, for example, in a call centre to calculate the number of trunks one need to carry a certain amount of phone traffic with a certain "target service".

Erlang C distribution: this formula is much more difficult and is often used, for example, to calculate how long callers will have to wait before being connected to a human in a call centre or similar situation.

Stochastic processes

The Erlang distribution is the distribution of the sum of k independent identically distributed random variables each having an exponential distribution. The long-run rate at which events occur is the reciprocal of the expectation of X X X , that is λ / k λ k \lambda/k . The (age specific event) rate of the Erlang distribution is, for k > 1 k 1 k>1 , monotonic in x x x , increasing from zero at x = 0 x 0 x=0 , to λ λ \lambda as x x x tends to infinity.<ref>Cox, D.R. (1967) Renewal Theory, p20, Methuen.</ref>

Related distributions

See also

Template:Refimprove Template:Inline

Notes

<references/>

References

External links

Template:ProbDistributionsca:Distribució d'Erlang de:Erlang-Verteilung es:Distribución de Erlang fa:توزیع ارلانگ fr:Loi d'Erlang nl:Erlang-verdeling ja:アーラン分布 pl:Rozkład Erlanga pt:Distribuição Erlang zh:爱尔朗分布