pith. sign in

arxiv: 1601.03906 · v1 · pith:VYMZ2VRXnew · submitted 2016-01-15 · 🧮 math.ST · stat.TH

Polynomial Pickands functions

classification 🧮 math.ST stat.TH
keywords pickandsfunctionspolynomialapproximationbelongingbernsteinclassdependence
0
0 comments X
read the original 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\geq0$, and show that these can be parameterized by a vector in $\mathbb{R}^{m+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 $\mathbb{R}^{m+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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.