SearcharxivSearch

arXiv · 2607.22878

Clustering of large deviations in heavy-tailed moving averages: the catastrophe principle in the long-memory case

Abstract

Clustering of large deviations events in a stationary stochastic process depends critically on the interplay between the tail behavior of the marginal distribution and the strength of temporal dependence. In the class of doubly infinite moving average processes, when the memory is short, previous work has established a sharp contrast in the clustering patterns between light- and heavy-tailed settings, governed by \textit{conspiracy} and \textit{catastrophe} principles respectively. It has also been described how long memory interacts with the conspiracy principle to affect clustering in the light-tailed case. This paper addresses the interaction of long memory with the catastrophe principle in the heavy-tailed case. It turns out that long memory generally allows for a wider range of catastrophes to play a role and leads to longer and qualitatively different clustering patterns.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jiaqi Wang, Gennady Samorodnitsky. 2026-07-24. Clustering of large deviations in heavy-tailed moving averages: the catastrophe principle in the long-memory case. https://arxiv.org/abs/2607.22878

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