SearcharxivSearch

arXiv · 2201.06623

Extremal clustering and cluster counting for spatial random fields

Abstract

We consider a stationary random field indexed by an increasing sequence of subsets of $\mathbb{Z}^d$ obeying a very broad geometrical assumption on how the sequence expands. Under certain mixing and local conditions, we show how the tail distribution of the individual variables relates to the tail behavior of the maximum of the field over the index sets in the limit as the index sets expand. Furthermore, in a framework where we let the increasing index sets be scalar multiplications of a fixed set $C$, potentially with different scalars in different directions, we use two cluster definitions to define associated cluster counting point processes on the rescaled index set $C$; one cluster definition divides the index set into more and more boxes and counts a box as a cluster if it contains an extremal observation. The other cluster definition that is more intuitive considers extremal points to be in the same cluster, if they are close in distance. We show that both cluster point processes converge to a Poisson point process on $C$. Additionally, we find a limit of the mean cluster size. Finally, we pay special attention to the case without clusters.

Explore related subjects

Keep this discovery

BibTeXRIS

Anders Rønn-Nielsen, Mads Stehr. 2022-01-17. Extremal clustering and cluster counting for spatial random fields. https://arxiv.org/abs/2201.06623

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