The realization problem for tail correlation functions

preprint2016arXivOpen access

Abstract

For a stochastic process {Xt}t∈T\{X_t\}_{t \in T} with identical one-dimensional margins and upper endpoint τupτ_{\text{up}} its tail correlation function (TCF) is defined through χ(X)(s,t)=lim⁡τ→τupP(Xs>τ ∣ Xt>τ)χ^{(X)}(s,t) = \lim_{τ\to τ_{\text{up}}} P(X_s > τ\,\mid\, X_t > τ). It is a popular bivariate summary measure that has been frequently used in the literature in order to assess tail dependence. In this article, we study its realization problem. We show that the set of all TCFs on T×TT \times T coincides with the set of TCFs stemming from a subclass of max-stable processes and can be completely characterized by a system of affine inequalities. Basic closure properties of the set of TCFs and regularity implications of the continuity of χχ are derived. If TT is finite, the set of TCFs on T×TT \times T forms a convex polytope of ∣T∣×∣T∣\lvert T \rvert \times \lvert T \rvert matrices. Several general results reveal its complex geometric structure. Up to ∣T∣=6\lvert T \rvert = 6 a reduced system of necessary and sufficient conditions for being a TCF is determined. None of these conditions will become obsolete as ∣T∣≥3\lvert T \rvert\geq 3 grows.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.