SearcharxivSearch

arXiv · 2112.15380

Tail processes and tail measures: An approach via Palm calculus

Abstract

Using an intrinsic approach, we study some properties of random fields which appear as tail fields of regularly varying stationary random fields. The index set is allowed to be a general locally compact Hausdorff Abelian group $\mathbb{G}$. The values are taken in a measurable cone, equipped with a pseudo norm. We first discuss some Palm formulas for the exceedance random measure $\xi$ associated with a stationary (measurable) random field $Y=(Y_s)_{s\in \mathbb{G}}$. It is important to allow the underlying stationary measure to be $\sigma$-finite. Then we proceed to a random field (defined on a probability space) which is spectrally decomposable, in a sense which is motivated by extreme value theory. We characterize mass-stationarity of the exceedance random measure in terms of a suitable version of the classical Mecke equation. We also show that the associated stationary measure is homogeneous, that is a tail measure. We then proceed with establishing and studying the spectral representation of stationary tail measures and with characterizing a moving shift representation. Finally we discuss anchoring maps and the candidate extremal index.

Explore related subjects

Keep this discovery

BibTeXRIS

Günter Last. 2021-12-31. Tail processes and tail measures: An approach via Palm calculus. https://arxiv.org/abs/2112.15380

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