SearcharxivSearch

arXiv · 2203.16631

Extreme value theory for a sequence of suprema of a class of Gaussian processes with trend

Abstract

We investigate extreme value theory of a class of random sequences defined by the all-time suprema of aggregated self-similar Gaussian processes with trend. This study is motivated by its potential applications in various areas and its theoretical interestingness. We consider both stationary sequences and non-stationary sequences obtained by considering whether the trend functions are identical or not. We show that a sequence of suitably normalised $k$th order statistics converges in distribution to a limiting random variable which can be a negative log transformed Erlang distributed random variable, a Normal random variable or a mixture of them, according to three conditions deduced through the model parameters. Remarkably, this phenomenon resembles that for the stationary Normal sequence. We also show that various moments of the normalised $k$th order statistics converge to the moments of the corresponding limiting random variable. The obtained results enable us to analyze various properties of these random sequences, which reveals the interesting particularities of this class of random sequences in extreme value theory.

Explore related subjects

Keep this discovery

BibTeXRIS

Lanpeng Ji, Xiaofan Peng. 2022-03-30. Extreme value theory for a sequence of suprema of a class of Gaussian processes with trend. https://arxiv.org/abs/2203.16631

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