Limit theorems for empirical processes of cluster functionals

Abstract

Let (Xn,i)1≤i≤n,n∈ℕ be a triangular array of row-wise stationary ℝd-valued random variables. We use a “blocks method” to define clusters of extreme values: the rows of (Xn,i) are divided into mn blocks (Yn,j), and if a block contains at least one extreme value, the block is considered to contain a cluster. The cluster starts at the first extreme value in the block and ends at the last one. The main results are uniform central limit theorems for empirical processes $Z_{n}(f):=\frac{1}{\sqrt{nv_{n}}}\sum_{j=1}^{m_{n}}(f(Y_{n,j})-Ef(Y_{n,j}))$, for vn = P{Xn,i ≠ 0} and f belonging to classes of cluster functionals, that is, functions of the blocks Yn,j which only depend on the cluster values and which are equal to 0 if Yn,j does not contain a cluster. Conditions for finite-dimensional convergence include β-mixing, suitable Lindeberg conditions and convergence of covariances. To obtain full uniform convergence, we use either “bracketing entropy” or bounds on covering numbers with respect to a random semi-metric. The latter makes it possible to bring the powerful Vapnik–Červonenkis theory to bear. Applications include multivariate tail empirical processes and empirical processes of cluster values and of order statistics in clusters. Although our main field of applications is the analysis of extreme values, the theory can be applied more generally to rare events occurring, for example, in nonparametric curve estimation.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 51 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.