Search arXivSearch

arXiv · 1405.6876

The realization problem for tail correlation functions

Abstract

For a stochastic process $\{X_t\}_{t \in T}$ with identical one-dimensional margins and upper endpoint $\tau_{\text{up}}$ its tail correlation function (TCF) is defined through $\chi^{(X)}(s,t) = \lim_{\tau \to \tau_{\text{up}}} P(X_s > \tau \,\mid\, X_t > \tau )$. 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 \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 $\chi$ are derived. If $T$ is finite, the set of TCFs on $T \times T$ forms a convex polytope of $\lvert T \rvert \times \lvert T \rvert$ matrices. Several general results reveal its complex geometric structure. Up to $\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 $\lvert T \rvert\geq 3$ grows.

Explore related subjects

Keep this discovery

BibTeXRIS

Ulf-Rainer Fiebig, Kirstin Strokorb, Martin Schlather. 2014-05-27. The realization problem for tail correlation functions. https://arxiv.org/abs/1405.6876

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR