SearcharxivSearch

arXiv · 1606.02927

Conditional Extreme Value Models: Fallacies and Pitfalls

Abstract

Conditional extreme value models have been introduced by Heffernan and Resnick (2007) to describe the asymptotic behavior of a random vector as one specific component becomes extreme. Obviously, this class of models is related to classical multivariate extreme value theory which describes the behavior of a random vector as its norm (and therefore at least one of its components) becomes extreme. However, it turns out that this relationship is rather subtle and sometimes contrary to intuition. We clarify the differences between the two approaches with the help of several illuminative (counter)examples. Furthermore, we discuss marginal standardization, which is a useful tool in classical multivariate extreme value theory but, as we point out, much less straightforward and sometimes even obscuring in conditional extreme value models. Finally, we indicate how, in some situations, a more comprehensive characterization of the asymptotic behavior can be obtained if the conditions of conditional extreme value models are relaxed so that the limit is no longer unique.

Explore related subjects

Keep this discovery

BibTeXRIS

Holger Drees, Anja Janßen. 2016-06-09. Conditional Extreme Value Models: Fallacies and Pitfalls. https://arxiv.org/abs/1606.02927

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