SearcharxivSearch

arXiv · 1109.6209

Extremes of independent stochastic processes: a point process approach

Abstract

For each $n\geq 1$, let $ {X_{in}, \quad i \geq 1} $ be independent copies of a nonnegative continuous stochastic process $X_{n}=(X_n(t))_{t\in T}$ indexed by a compact metric space $T$. We are interested in the process of partial maxima [\tilde M_n(u,t) =\max \{X_{in}(t), 1 \leq i\leq [nu]},\quad u\geq 0,\ t\in T.] where the brackets $[\,\cdot\,]$ denote the integer part. Under a regular variation condition on the sequence of processes $X_n$, we prove that the partial maxima process $\tilde M_n$ weakly converges to a superextremal process $\tilde M$ as $n\to\infty$. We use a point process approach based on the convergence of empirical measures. Properties of the limit process are investigated: we characterize its finite-dimensional distributions, prove that it satisfies an homogeneous Markov property, and show in some cases that it is max-stable and self-similar. Convergence of further order statistics is also considered. We illustrate our results on the class of log-normal processes in connection with some recent results on the extremes of Gaussian processes established by Kabluchko.

Explore related subjects

Keep this discovery

BibTeXRIS

Clément Dombry, Frédéric Eyi-Minko. 2011-10-06. Extremes of independent stochastic processes: a point process approach. https://arxiv.org/abs/1109.6209

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