Hyperexponential distribution
In probability theory, a hyper-exponential distribution is a continuous probability distribution whose probability density function of the random variable X is given by
where each Yi is an exponentially distributed random variable with rate parameter λi, and pi is the probability that X will take on the form of the exponential distribution with rate λi.[1] It is named the hyper-exponential 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 less than one. While the exponential distribution is the continuous analogue of the geometric distribution, the hyper-exponential distribution is not analogous to the hypergeometric distribution. The hyper-exponential distribution is an example of a mixture density.
An example of a hyper-exponential 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 hyper-exponential 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 of the hyper-exponential distribution [edit]
Since the expected value of a sum is the sum of the expected values, the expected value of a hyper-exponential random variable can be shown as
and
from which we can derive the variance:[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
See also [edit]
References [edit]
- ^ Singh, Larry N.; G. R. Dattatreya (2007). "Estimation of the Hyperexponential Density with Applications in Sensor Networks". International Journal of Distributed Sensor Networks 3 (3): 311–330. doi:10.1080/15501320701259925.
- ^ H.T. Papadopolous, C. Heavey, and J. Browne (1993). Queueing Theory in Manufacturing Systems Analysis and Design. Springer. p. 35. ISBN 9780412387203.
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||

![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}](http://upload.wikimedia.org/math/b/6/f/b6f53c3f14f76e4b0b2067983c73a0ca.png)
![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,](http://upload.wikimedia.org/math/0/1/9/019dca9f9e01520e44d08a57c1e8af5a.png)
![\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.](http://upload.wikimedia.org/math/f/d/c/fdc25aaa7750051a9bb5efffc7455525.png)
![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.](http://upload.wikimedia.org/math/0/b/2/0b274213772df38549f7a5361318c317.png)