SearcharxivSearch

arXiv · 2409.17966

A remarkable example on clustering of extremes for regularly-varying stochastic processes

Abstract

The stable-regenerative multiple-stable model has been shown recently to have distinct candidate extremal index and extremal index. To understand further this rare phenomenon, two more results are established here for the double-stable model. The first is the convergence of point processes for the clusters of extremes, enhancing the previous result on the weak convergence of random sup-measures. Most interestingly, the second result reveals a new phase transition at the mesoscopic level when computing the asymptotic exceedance probability over a block, $\mathbb P(\max_{k=1,\dots,d_n} X_k>b_n)$, as $n\to\infty$. Here, the mesoscopic level is referred to the fact that the block size $d_n$ is allowed to grow at the rate $n^\rho$ with $\rho\in[0,1]$, while the threshold $b_n$ is such that $\mathbb P(X_1>b_n)\sim 1/n$. The recently discovered discrepancy between the candidate extremal index and the extremal index is shown to be just a reflection of this phase transition that is prohibited by the anticlustering condition.

Explore related subjects

Keep this discovery

BibTeXRIS

Shuyang Bai, Rafał Kulik, Yizao Wang. 2024-09-26. A remarkable example on clustering of extremes for regularly-varying stochastic processes. https://arxiv.org/abs/2409.17966

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