Английская Википедия:Erlang distribution

Содержание

Текст

Текст

Текст

Текст

Текст

Текст

Текст

Текст

Текст

Шаблон:Short description Шаблон:About Шаблон:Probability distribution{(k-1)!}</math> |cdf =<math> P(k, \lambda x) = \frac{\gamma(k, \lambda x)}{(k - 1)!} = 1 - \sum_{n=0}^{k-1}\frac{1}{n!}e^{-\lambda x}(\lambda x)^{n}</math> |mean =<math> \frac{k}{\lambda}</math> |mode =<math> \frac{1}{\lambda}(k - 1)</math> |variance =<math> \frac{k}{\lambda^2}</math> |median =No simple closed form |skewness =<math> \frac{2}{\sqrt{k}}</math> |kurtosis =<math> \frac{6}{k}</math> |entropy =<math> (1 - k)\psi(k) + \ln\left[\frac{\Gamma(k)}{\lambda}\right] + k</math> |mgf =<math> \left(1 - \frac{t}{\lambda}\right)^{-k}</math> for <math> t < \lambda</math> |char =<math> \left(1 - \frac{it}{\lambda}\right)^{-k}</math>| }} The Erlang distribution is a two-parameter family of continuous probability distributions with support <math> x \in [0, \infty)</math>. The two parameters are:

• a positive integer <math>k,</math> the "shape", and
• a positive real number <math>\lambda,</math> the "rate". The "scale", <math>\beta,</math> the reciprocal of the rate, is sometimes used instead.

The Erlang distribution is the distribution of a sum of <math>k</math> independent exponential variables with mean <math>1/\lambda</math> each. Equivalently, it is the distribution of the time until the kth event of a Poisson process with a rate of <math>\lambda</math>. The Erlang and Poisson distributions are complementary, in that while the Poisson distribution counts the number of events that occur in a fixed amount of time, the Erlang distribution counts the amount of time until the occurrence of a fixed number of events. When <math>k=1</math>, the distribution simplifies to the exponential distribution. The Erlang distribution is a special case of the gamma distribution wherein the shape of the distribution is discretised.

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 also used in the field of stochastic processes.

Characterization

Probability density function

The probability density function of the Erlang distribution is

<math>f(x; k,\lambda)={\lambda^k x^{k-1} e^{-\lambda x} \over (k-1)!}\quad\mbox{for }x, \lambda \geq 0,</math>

The parameter k is called the shape parameter, and the parameter <math>\lambda</math> is called the rate parameter.

An alternative, but equivalent, parametrization uses the scale parameter <math>\beta</math>, which is the reciprocal of the rate parameter (i.e., <math>\beta = 1/\lambda</math>):

<math>f(x; k,\beta)=\frac{ x^{k-1} e^{-\frac{x}{\beta}} }{\beta^k (k-1)!}\quad\mbox{for }x, \beta \geq 0.</math>

When the scale parameter <math>\beta</math> equals 2, the distribution simplifies to the chi-squared distribution with 2k degrees of freedom. It can therefore be regarded as a generalized chi-squared distribution for even numbers of degrees of freedom.

Cumulative distribution function (CDF)

The cumulative distribution function of the Erlang distribution is

<math>F(x; k,\lambda) = P(k, \lambda x) = \frac{\gamma(k, \lambda x)}{\Gamma(k)} = \frac{\gamma(k, \lambda x)}{(k-1)!},</math>

where <math>\gamma</math> is the lower incomplete gamma function and <math>P</math> is the lower regularized gamma function. The CDF may also be expressed as

<math>F(x; k,\lambda) = 1 - \sum_{n=0}^{k-1}\frac{1}{n!}e^{-\lambda x}(\lambda x)^n.</math>

Erlang-k

The Erlang-k distribution (where k is a positive integer) <math>E_k(\lambda)</math> is defined by setting k in the PDF of the Erlang distribution. For instance, the Erlang-2 distribution is <math>E_2(\lambda) ={\lambda^2 x} e^{-\lambda x} \quad\mbox{for }x, \lambda \geq 0</math>, which is the same as <math>f(x; 2,\lambda)</math>.

Median

An asymptotic expansion is known for the median of an Erlang distribution, for which coefficients can be computed and bounds are known. An approximation is <math>\frac{k}{\lambda}\left(1-\dfrac{1}{3k+0.2}\right),</math> i.e. below the mean <math>\frac{k}{\lambda}.</math>

Generating Erlang-distributed random variates

Erlang-distributed random variates can be generated from uniformly distributed random numbers (<math>U \in [0,1]</math>) using the following formula:

<math>E(k,\lambda) = -\frac{1}\lambda \ln \prod_{i=1}^k U_{i} = -\frac{1}\lambda \sum_{i=1}^k \ln U_{i} </math>

Applications

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 erlangs. 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.

Other applications

The age distribution of cancer incidence often follows the Erlang distribution, whereas the shape and scale parameters predict, respectively, the number of driver events and the time interval between them. More generally, the Erlang distribution has been suggested as good approximation of cell cycle time distribution, as result of multi-stage models.

It has also been used in business economics for describing interpurchase times.

Properties

• If <math> X \sim \operatorname{Erlang}(k, \lambda)</math> then <math> a \cdot X \sim \operatorname{Erlang}\left(k, \frac{\lambda}{a}\right)</math> with <math> a \in \mathbb{R}</math>
• If <math> X \sim \operatorname{Erlang}(k_1, \lambda)</math> and <math> Y \sim \operatorname{Erlang}(k_2, \lambda)</math> then <math> X + Y \sim \operatorname{Erlang}(k_1 + k_2, \lambda)</math> if <math> X, Y </math> are independent

Related distributions

• The Erlang distribution is the distribution of the sum of k independent and identically distributed random variables, each having an exponential distribution. The long-run rate at which events occur is the reciprocal of the expectation of <math>X,</math> that is, <math>\lambda/k.</math> The (age specific event) rate of the Erlang distribution is, for <math>k>1,</math> monotonic in <math>x,</math> increasing from 0 at <math>x=0,</math> to <math>\lambda</math> as <math>x</math> tends to infinity.
  • That is: if <math> X_i \sim \operatorname{Exponential}(\lambda),</math> then <math display="block"> \sum_{i=1}^k{X_i} \sim \operatorname{Erlang}(k, \lambda)</math>
• Because of the factorial function in the denominator of the PDF and CDF, 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 <math>k=2</math>). The gamma distribution generalizes the Erlang distribution by allowing k to be any positive real number, using the gamma function instead of the factorial function.
  • That is: if k is an integer and <math> X \sim \operatorname{Gamma}(k, \lambda),</math> then <math> X \sim \operatorname{Erlang}(k, \lambda)</math>
• If <math> U \sim \operatorname{Exponential}(\lambda)</math> and <math> V \sim \operatorname{Erlang}(n, \lambda)</math> then <math> \frac{U}{V}+1 \sim \operatorname{Pareto}(1, n)</math>
• The Erlang distribution is a special case of the Pearson type III distributionШаблон:Citation needed
• The Erlang distribution is related to the chi-squared distribution. If <math> X \sim \operatorname{Erlang}(k,\lambda),</math> then <math> 2\lambda X\sim \chi^2_{2k}.</math>Шаблон:Citation needed
• The Erlang distribution is related to the Poisson distribution by the Poisson process: If <math> S_n = \sum_{i=1}^n X_i</math> such that <math> X_i \sim \operatorname{Exponential}(\lambda),</math> then <math display="block"> S_n \sim \operatorname{Erlang}(n, \lambda)</math> and <math display="block"> \operatorname{Pr}(N(x) \leq n - 1) = \operatorname{Pr}(S_n > x) = 1 - F_X(x; n, \lambda) = \sum_{k=0}^{n-1} \frac{1}{k!}e^{-\lambda x} (\lambda x)^k.</math> Taking the differences over <math>n</math> gives the Poisson distribution.

See also

• Coxian distribution
• Engset calculation
• Erlang B formula
• Erlang unit
• Phase-type distribution
• Traffic generation model

References

• Ian Angus "An Introduction to Erlang B and Erlang C", Telemanagement #187 (PDF Document - Has terms and formulae plus short biography)
• Stuart Harris "Erlang Calculations vs. Simulation"

External links

• Erlang Distribution
• Resource Dimensioning Using Erlang-B and Erlang-C