Math 2.0

Statistics Nonparametric inference Theorem

Pickands–Balkema–De Haan theorem

Builds on Fisher–Tippett–Gnedenko theoremCumulative distribution functionIndependent and identically distributed random variablesConvergence in distribution

Statement

Let FF be a cumulative distribution function on ℝ\R and let xF=sup⁡{x:F(x)<1}≤∞x_F = \sup\set{x : F(x) < 1} \le \infty be its right endpoint. For u<xFu < x_F, let FuF_u be the excess distribution over the threshold uu: Fu(y)=F(u+y)−F(u)1−F(u),0≤y<xF−u,F_u(y) = \frac{F(u + y) - F(u)}{1 - F(u)}, \qquad 0 \le y < x_F - u, the law of X−uX - u given X>uX > u when XX has distribution function FF. For ξ∈ℝ\xi \in \R and β>0\beta > 0, let Gξ,βG_{\xi, \beta} be the generalised Pareto distribution function Gξ,β(y)=1−(1+ξyβ)−1/ξ (ξ≠0),G0,β(y)=1−e−y/β,G_{\xi, \beta}(y) = 1 - \Big(1 + \frac{\xi y}{\beta}\Big)^{-1/\xi} \ (\xi \ne 0), \qquad G_{0, \beta}(y) = 1 - e^{-y/\beta}, for y≥0y \ge 0 if ξ≥0\xi \ge 0 and for 0≤y≤−β/ξ0 \le y \le -\beta/\xi if ξ<0\xi < 0. Say that FF is in the maximum domain of attraction of Hξ(x)=exp⁡(−(1+ξx)−1/ξ)H_\xi(x) = \exp\big(-(1 + \xi x)^{-1/\xi}\big) (with H0(x)=exp⁡(−e−x)H_0(x) = \exp(-e^{-x})) if, for i.i.d. X1,X2,…X_1, X_2, \dots with distribution function FF, there are an>0a_n > 0 and bn∈ℝb_n \in \R such that (max⁡i≤nXi−bn)/an(\max_{i \le n} X_i - b_n)/a_n converges in distribution to HξH_\xi.

Then the following holds for each ξ∈ℝ\xi \in \R. The function FF is in the maximum domain of attraction of HξH_\xi if and only if there is a positive measurable function β(u)\beta(u) with lim⁡u↑xF sup⁡0≤y<xF−u∣Fu(y)−Gξ,β(u)(y)∣=0.\lim_{u \uparrow x_F} \ \sup_{0 \le y < x_F - u} \abs{F_u(y) - G_{\xi, \beta(u)}(y)} = 0.

Remarks

Idea of the proof. Membership in the domain of attraction of HξH_\xi is equivalent to the existence of a positive function a(u)a(u) with 1−F(u+a(u)y)1−F(u)→(1+ξy)−1/ξ\frac{1 - F(u + a(u) y)}{1 - F(u)} \to (1 + \xi y)^{-1/\xi} as u↑xFu \uparrow x_F, for each admissible yy. The left side is 1−Fu(a(u)y)1 - F_u(a(u) y), so this is pointwise convergence of rescaled excess laws to Gξ,1G_{\xi, 1}, and β(u)=a(u)\beta(u) = a(u) works. Uniformity in yy follows because the functions are monotone and the limit is continuous.

Examples. For the exponential law F(x)=1−e−xF(x) = 1 - e^{-x}, Fu(y)=1−e−yF_u(y) = 1 - e^{-y} for every uu, so ξ=0\xi = 0 and β(u)=1\beta(u) = 1 give equality. For the Pareto law 1−F(x)=x−α1 - F(x) = x^{-\alpha} for x≥1x \ge 1, Fu(y)=1−(1+y/u)−α=G1/α, u/α(y)F_u(y) = 1 - (1 + y/u)^{-\alpha} = G_{1/\alpha, \, u/\alpha}(y) for u≥1u \ge 1. For the uniform law on [0,1][0, 1], Fu(y)=y/(1−u)=G−1, 1−u(y)F_u(y) = y/(1 - u) = G_{-1, \, 1 - u}(y).

The hypothesis is not automatic: some laws lie in no domain of attraction, for example the Poisson and geometric laws. Their excesses over high thresholds have no generalised Pareto limit.

Going deeper

For a student

The theorem is the threshold counterpart of the Fisher–Tippett–Gnedenko theorem, which describes the limit laws of maxima. The same shape parameter ξ\xi appears in both. One has ξ>0\xi > 0 for heavy, Pareto-like tails, ξ=0\xi = 0 for light tails such as the normal and exponential laws, and ξ<0\xi < 0 for laws with a finite right endpoint. In practice it justifies the peaks-over-threshold method of extreme value statistics. One fits Gξ,βG_{\xi, \beta} to the excesses over a high threshold by maximum likelihood and uses the fit to estimate high quantiles and tail probabilities.

Reading path

To understand this page from the ground up, read these 55 pages in order. The foundations come first.

  1. Construction of the reals from Cauchy sequences concept
  2. Convergence in distribution concept
  3. Cumulative distribution function concept
  4. Element definition
  5. Exponential distribution concept
  6. Independent and identically distributed random variables concept
  7. Integers object
  8. Ordered field definition
  9. Proposition concept
  10. Random experiment concept
  11. Rational numbers object
  12. Real numbers object
  13. Fisher–Tippett–Gnedenko theorem statement
  14. Set definition
  15. Ring of integers statement
  16. Disjunction definition
  17. Implication definition
  18. Predicate definition
  19. Ordered pair definition
  20. Union definition
  21. Existential quantifier definition
  22. Sample space definition
  23. Universal quantifier definition
  24. The rationals form a field statement
  25. Cartesian product definition
  26. Subset definition
  27. Uniqueness quantifier definition
  28. The rationals form an ordered field statement
  29. Binary relation definition
  30. Power set definition
  31. Universal set definition
  32. Order on the reals definition
  33. Function definition
  34. Complement definition
  35. Interval definition
  36. Preimage of a set definition
  37. Sigma-algebra definition
  38. Event definition
  39. Borel sigma-algebra definition
  40. Probability axioms concept
  41. Probability measure definition
  42. Probability distribution definition
  43. Probability space definition
  44. Conditional probability definition
  45. Random variable definition
  46. Independence of two events definition
  47. Cumulative distribution function definition
  48. Law of a random variable definition
  49. Mutual independence of events definition
  50. Convergence in distribution definition
  51. Identically distributed random variables definition
  52. Independent sigma-algebras definition
  53. Independence of random variables definition
  54. Independent and identically distributed random variables definition
  55. Pickands–Balkema–De Haan theorem statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Pickands%E2%80%93Balkema%E2%80%93De_Haan_theorem
About this page
Tag62TMXRHZ76
URIm2://62TMXRHZ76
Kindstatement, theorem
WritingW0 stub
MSC62G32, 60G70
StatusThis copy of the site has no build data. Run m2 status 62TMXRHZ76.
AboutFisher–Tippett–Gnedenko theorem
UsesFisher–Tippett–Gnedenko theorem, Cumulative distribution function, Independent and identically distributed random variables, Convergence in distribution
Same as

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.