Heavy-tailed distribution

In probability theory, heavy-tailed distributions are probability distributions whose tails are not exponentially bounded: that is, they have heavier tails than the exponential distribution. In many applications it is the right tail of the distribution that is of interest, but a distribution may have a heavy left tail, or both tails may be heavy.
There are three important subclasses of heavy-tailed distributions: the fat-tailed distributions, the long-tailed distributions, and the subexponential distributions. In practice, all commonly used heavy-tailed distributions belong to the subexponential class, introduced by Jozef Teugels.
There is still some discrepancy over the use of the term heavy-tailed. There are two other definitions in use. Some authors use the term to refer to those distributions which do not have all their power moments finite; and some others to those distributions that do not have a finite variance. The definition given in this article is the most general in use, and includes all distributions encompassed by the alternative definitions, as well as those distributions such as log-normal that possess all their power moments, yet which are generally considered to be heavy-tailed. (Occasionally, heavy-tailed is used for any distribution that has heavier tails than the normal distribution.)
The distribution of a random variable X with distribution function F is said to have a heavy (right) tail if the moment generating function of X, MX(t), is infinite for all t > 0.
That means
This is also written in terms of the tail distribution function
as
The distribution of a random variable X with distribution function F is said to have a long right tail if for all t > 0,
or equivalently
This has the intuitive interpretation for a right-tailed long-tailed distributed quantity that if the long-tailed quantity exceeds some high level, the probability approaches 1 that it will exceed any other higher level.
All long-tailed distributions are heavy-tailed, but the converse is false, and it is possible to construct heavy-tailed distributions that are not long-tailed.
Subexponentiality is defined in terms of convolutions of probability distributions. For two independent, identically distributed random variables X 1 , X 2 {\displaystyle X_{1},X_{2}} with a common distribution function F {\displaystyle F} , the convolution of F {\displaystyle F} with itself, written F ∗ 2 {\displaystyle F^{*2}} and called the convolution square, is defined using Lebesgue–Stieltjes integration by:
and the n-fold convolution F ∗ n {\displaystyle F^{*n}} is defined inductively by the rule:
The tail distribution function F ¯ {\displaystyle {\overline {F}}} is defined as F ¯ ( x ) = 1 − F ( x ) {\displaystyle {\overline {F}}(x)=1-F(x)} .
A distribution F {\displaystyle F} on the positive half-line is subexponential if
This implies that, for any n ≥ 1 {\displaystyle n\geq 1} ,
The probabilistic interpretation of this is that, for a sum of n {\displaystyle n} independent random variables X 1 , … , X n {\displaystyle X_{1},\ldots ,X_{n}} with common distribution F {\displaystyle F} ,
This is often known as the principle of the single big jump or catastrophe principle.
A distribution F {\displaystyle F} on the whole real line is subexponential if the distribution F I ( [ 0 , ∞ ) ) {\displaystyle FI([0,\infty ))} is. Here I ( [ 0 , ∞ ) ) {\displaystyle I([0,\infty ))} is the indicator function of the positive half-line. Alternatively, a random variable X {\displaystyle X} supported on the real line is subexponential if and only if X + = max ( 0 , X ) {\displaystyle X^{+}=\max(0,X)} is subexponential.
All subexponential distributions are long-tailed, but examples can be constructed of long-tailed distributions that are not subexponential.
All commonly used heavy-tailed distributions are subexponential.
Those that are one-tailed include:
Those that are two-tailed include:
A fat-tailed distribution is a distribution for which the probability density function, for large x, goes to zero as a power x − a {\displaystyle x^{-a}} . Since such a power is always bounded below by the probability density function of an exponential distribution, fat-tailed distributions are always heavy-tailed. Some distributions, however, have a tail which goes to zero slower than an exponential function (meaning they are heavy-tailed), but faster than a power (meaning they are not fat-tailed). An example is the log-normal distribution . Many other heavy-tailed distributions such as the log-logistic and Pareto distribution are, however, also fat-tailed.
There are parametric and non-parametric approaches to the problem of the tail-index estimation.
To estimate the tail-index using the parametric approach, some authors employ GEV distribution or Pareto distribution; they may apply the maximum-likelihood estimator (MLE).
With ( X n , n ≥ 1 ) {\displaystyle (X_{n},n\geq 1)} a random sequence of independent and same density function F ∈ D ( H ( ξ ) ) {\displaystyle F\in D(H(\xi ))} , the Maximum Attraction Domain of the generalized extreme value density H {\displaystyle H} , where ξ ∈ R {\displaystyle \xi \in \mathbb {R} } . If lim n → ∞ k ( n ) = ∞ {\displaystyle \lim _{n\to \infty }k(n)=\infty } and lim n → ∞ k ( n ) n = 0 {\displaystyle \lim _{n\to \infty }{\frac {k(n)}{n}}=0} , then the Pickands tail-index estimation is
where X ( n − k ( n ) + 1 , n ) = max ( X n − k ( n ) + 1 , … , X n ) {\displaystyle X_{(n-k(n)+1,n)}=\max \left(X_{n-k(n)+1},\ldots ,X_{n}\right)} . This estimator converges in probability to ξ {\displaystyle \xi } .
Let ( X t , t ≥ 1 ) {\displaystyle (X_{t},t\geq 1)} be a sequence of independent and identically distributed random variables with distribution function F ∈ D ( H ( ξ ) ) {\displaystyle F\in D(H(\xi ))} , the maximum domain of attraction of the generalized extreme value distribution H {\displaystyle H} , where ξ ∈ R {\displaystyle \xi \in \mathbb {R} } . The sample path is X t : 1 ≤ t ≤ n {\displaystyle {X_{t}:1\leq t\leq n}} where n {\displaystyle n} is the sample size. If { k ( n ) } {\displaystyle \{k(n)\}} is an intermediate order sequence, i.e. k ( n ) ∈ { 1 , … , n − 1 } , {\displaystyle k(n)\in \{1,\ldots ,n-1\},} , k ( n ) → ∞ {\displaystyle k(n)\to \infty } and k ( n ) / n → 0 {\displaystyle k(n)/n\to 0} , then the Hill tail-index estimator is
where X ( i , n ) {\displaystyle X_{(i,n)}} is the i {\displaystyle i} -th order statistic of X 1 , … , X n {\displaystyle X_{1},\dots ,X_{n}} . This estimator converges in probability to ξ {\displaystyle \xi } , and is asymptotically normal provided k ( n ) → ∞ {\displaystyle k(n)\to \infty } is restricted based on a higher order regular variation property . Consistency and asymptotic normality extend to a large class of dependent and heterogeneous sequences, irrespective of whether X t {\displaystyle X_{t}} is observed, or a computed residual or filtered data from a large class of models and estimators, including mis-specified models and models with errors that are dependent. Note that both Pickand's and Hill's tail-index estimators commonly make use of logarithm of the order statistics.
The ratio estimator (RE-estimator) of the tail-index was introduced by Goldie and Smith. It is constructed similarly to Hill's estimator but uses a non-random "tuning parameter".
A comparison of Hill-type and RE-type estimators can be found in Novak.
Nonparametric approaches to estimate heavy- and superheavy-tailed probability density functions were given in Markovich. These are approaches based on variable bandwidth and long-tailed kernel estimators; on the preliminary data transform to a new random variable at finite or infinite intervals, which is more convenient for the estimation and then inverse transform of the obtained density estimate; and "piecing-together approach" which provides a certain parametric model for the tail of the density and a non-parametric model to approximate the mode of the density. Nonparametric estimators require an appropriate selection of tuning (smoothing) parameters like a bandwidth of kernel estimators and the bin width of the histogram. The well known data-driven methods of such selection are a cross-validation and its modifications, methods based on the minimization of the mean squared error (MSE) and its asymptotic and their upper bounds. A discrepancy method which uses well-known nonparametric statistics like Kolmogorov-Smirnov's, von Mises and Anderson-Darling's ones as a metric in the space of distribution functions (dfs) and quantiles of the later statistics as a known uncertainty or a discrepancy value can be found in. Bootstrap is another tool to find smoothing parameters using approximations of unknown MSE by different schemes of re-samples selection, see e.g.