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

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


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


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


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.[3]

See also


  1. ^ Singh, L. N.; Dattatreya, G. R. (2007). "Estimation of the Hyperexponential Density with Applications in Sensor Networks". International Journal of Distributed Sensor Networks. 3 (3): 311. CiteSeerX doi:10.1080/15501320701259925.
  2. ^ H.T. Papadopolous; C. Heavey; J. Browne (1993). Queueing Theory in Manufacturing Systems Analysis and Design. Springer. p. 35. ISBN 9780412387203.
  3. ^ Feldmann, A.; Whitt, W. (1998). "Fitting mixtures of exponentials to long-tail distributions to analyze network performance models" (PDF). Performance Evaluation. 31 (3–4): 245. doi:10.1016/S0166-5316(97)00003-5.