Exceedance — where it appears
Named by 3 essays across one field — each of them below, with the objects they name alongside it.
Also named here as generalised pareto, peaks over threshold — the same set of essays touches all of them, so they are one junction rather than several.
The threshold is a dial
A peaks-over-threshold analysis has one knob, and raising it buys accuracy with exceedances. For a normal parent the error is smallest at the 0.925 quantile and 80.6% of it is still bias there — and both diagnostics practitioners use to set the knob lose to a fixed 0.90 rule, one by a factor of 1.590 and one by 11.881.
The clustering the tail has
Every threshold method counts exceedances as though they were independent pieces of information, and in a dependent series they arrive in clusters. Ignoring that overstates a return level by the reciprocal of the extremal index — ×3.527 counted where the mean cluster holds four — and leaves a reported standard error 2.151 times too small.
The run length a declustering chooses
The runs estimator of an extremal index carries a constant nobody derives. Where a cluster is a run of neighbouring exceedances the constant barely matters; where a cluster's members fall six steps apart, the estimate is 0.9069 at a run length of six and 0.3649 at seven against an index of 0.40, and a run length of four removes under a tenth of the overstatement declustering exists to remove. A rule that reads the run length off the data has the smallest worst error of the three.
Named alongside it
The objects these essays reach for when they reach for this one.
Closed formGeneralised ParetoPeaks over thresholdShape parameterStandard errorCluster sizeDeclusteringExtremal indexFréchet lawIndependenceMean squared errorReturn level