Skip to content
Surf Wiki
Save to docs
general/continuous-distributions

From Surf Wiki (app.surf) — the open knowledge base

Hyperexponential distribution

Continuous probability distribution

Hyperexponential distribution

Continuous probability distribution

Diagram showing queueing system equivalent of a hyperexponential distribution

In probability theory, a hyperexponential distribution is a continuous probability distribution whose probability density function of the random variable X is given by

: f_X(x) = \sum_{i=1}^n f_{Y_i}(x);p_i,

where each Y**i is an exponentially distributed random variable with rate parameter λ**i, and p**i is the probability that X will take on the form of the exponential distribution with rate λ**i. It is named the hyperexponential distribution since its coefficient of variation is greater than that of the exponential distribution, whose coefficient of variation is 1, and the hypoexponential distribution, which has a coefficient of variation smaller than one. While the exponential distribution is the continuous analogue of the geometric distribution, the hyperexponential distribution is not analogous to the hypergeometric distribution. The hyperexponential distribution is an example of a mixture density.

An example of a hyperexponential random variable can be seen in the context of telephony, where, if someone has a modem and a phone, their phone line usage could be modeled as a hyperexponential distribution where there is probability p of them talking on the phone with rate λ1 and probability q of them using their internet connection with rate λ2.

Properties

Since the expected value of a sum is the sum of the expected values, the expected value of a hyperexponential random variable can be shown as

: E[X] = \int_{-\infty}^\infty x f(x) , dx= \sum_{i=1}^n p_i\int_0^\infty x\lambda_i e^{-\lambda_ix} , dx = \sum_{i=1}^n \frac{p_i}{\lambda_i}

and

: E!\left[X^2\right] = \int_{-\infty}^\infty x^2 f(x) , dx = \sum_{i=1}^n p_i\int_0^\infty x^2\lambda_i e^{-\lambda_ix} , dx = \sum_{i=1}^n \frac{2}{\lambda_i^2}p_i,

from which we can derive the variance:

:\operatorname{Var}[X] = E!\left[X^2\right] - E!\left[X\right]^2 = \sum_{i=1}^n \frac{2}{\lambda_i^2}p_i - \left[\sum_{i=1}^n \frac{p_i}{\lambda_i}\right]^2 = \left[\sum_{i=1}^n \frac{p_i}{\lambda_i}\right]^2 + \sum_{i=1}^n \sum_{j=1}^n p_i p_j \left(\frac{1}{\lambda_i} - \frac{1}{\lambda_j} \right)^2.

The standard deviation exceeds the mean in general (except for the degenerate case of all the *λ*s being equal), so the coefficient of variation is greater than 1.

The moment-generating function is given by

:E!\left[e^{tx}\right] = \int_{-\infty}^\infty e^{tx} f(x) , dx= \sum_{i=1}^n p_i \int_0^\infty e^{tx}\lambda_i e^{-\lambda_i x} , dx = \sum_{i=1}^n \frac{\lambda_i}{\lambda_i - t}p_i.

Fitting

A given probability distribution, including a heavy-tailed distribution, can be approximated by a hyperexponential distribution by fitting recursively to different time scales using Prony's method.

References

References

  1. (2007). "Estimation of the Hyperexponential Density with Applications in Sensor Networks". International Journal of Distributed Sensor Networks.
  2. (1993). "Queueing Theory in Manufacturing Systems Analysis and Design". Springer.
  3. (1998). "Fitting mixtures of exponentials to long-tail distributions to analyze network performance models". Performance Evaluation.
Info: Wikipedia Source

This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page.

Want to explore this topic further?

Ask Mako anything about Hyperexponential distribution — get instant answers, deeper analysis, and related topics.

Research with Mako

Free with your Surf account

Content sourced from Wikipedia, available under CC BY-SA 4.0.

This content may have been generated or modified by AI. CloudSurf Software LLC is not responsible for the accuracy, completeness, or reliability of AI-generated content. Always verify important information from primary sources.

Report