SearcharxivSearch

arXiv · 2607.18505

A Vector Space Approach to Heavy Tailed Analysis

Abstract

We construct a vector space whose defining characteristics are rooted in univariate regular variation of random variables. Specifically, the base vector space $\mathbb{V}_b$ consists of random variables whose limiting tail probabilities, when scaled by regularly varying functions of the form $b(s)=s^\alpha L(s)$, are finite. Defining a subspace ${\cal N}_b$ corresponding to random variables in $\mathbb{V}_b$ whose limiting tail probabilities are zero when normalized by $b(s)$ allows the base space $\mathbb{V}_b$ to be partitioned into equivalence classes. We define a vector space $\mathbb{W}_b$ consisting of these equivalence classes, and show its nonzero elements are equivalence classes of regularly varying random variables. We show that a natural norm exists for $\mathbb{W}_b$ if $\alpha > 1$. We show that the equivalence classes and convergence in norm are different than more familiar vector spaces of random variables. Turning our attention to extreme value modeling, we consider finite-dimensional subspaces of $\mathbb{W}_b$ whose basis vectors are jointly regularly varying. We show that in the case $\alpha = 2$, the previously defined tail pairwise dependence measure serves as an inner product. As any finite-dimensional space is complete, we can use the projection theorem to perform linear prediction.

Explore related subjects

Keep this discovery

BibTeXRIS

Kenneth Broadhead, Daniel Cooley. 2026-07-20. A Vector Space Approach to Heavy Tailed Analysis. https://arxiv.org/abs/2607.18505

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