Polynomial Pickands functions

Abstract

Pickands dependence functions characterize bivariate extreme value copulas. In this paper, we study the class of polynomial Pickands functions. We provide a solution for the characterization of such polynomials of degree at most m+2, m≥0, and show that these can be parameterized by a vector in Rm+1 belonging to the intersection of two ellipsoids. We also study the class of Bernstein approximations of order m+2 of Pickands functions which are shown to be (polynomial) Pickands functions and parameterized by a vector in Rm+1 belonging to a polytope. We give necessary and sufficient conditions for which a polynomial Pickands function is in fact a Bernstein approximation of some Pickands function. Approximation results of Pickands dependence functions by polynomials are given. Finally, inferential methodology is discussed and comparisons based on simulated data are provided.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…