Search arXivSearch

arXiv · 1405.5580

Another look at Second order condition in Extreme Value Theory

Abstract

This note compares two approaches both alternatively used when establishing normality theorems in univariate Extreme Value Theory. When the underlying distribution function ($df$) is the extremal domain of attraction, it is possible to use representations for the quantile function and regularity conditions (RC), based on these representations, under which strong and weak convergence are valid. It is also possible to use the now fashion second order condition (SOC), whenever it holds, to do the same. Some authors usually favor the first approach (the SOC one) while others are fond of the second approach that we denote as the representational one. This note aims at comparing the two approaches and show how to get from one to the other. The auxiliary functions used in each approach are computed and compared. Statistical applications using simultaneously both approaches are provided. A final comparison is provided.

Explore related subjects

Keep this discovery

BibTeXRIS

Gane Samb Lo, Adja Mbarka Fall. 2014-05-22. Another look at Second order condition in Extreme Value Theory. https://arxiv.org/abs/1405.5580

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