SearcharxivSearch

arXiv · 2301.10113

Extremes of regularly varying stochastic volatility fields

Abstract

We consider a stationary stochastic volatility field $Y_vZ_v$ with $v\in\mathbb{Z}^d$, where $Z$ is regularly varying and $Y$ has lighter tails and is independent of $Z$. We make - relative to existing literature - very general assumptions on the dependence structure of both fields. In particular this allows $Y$ to be non-ergodic, in contrast to the typical assumption that it is i.i.d., and $Z$ to be given by an infinite moving average. Considering the stochastic volatility field on a (rather general) sequence of increasing index sets, we show the existence and form of a $Y$-dependent extremal functional generalizing the classical extremal index. More precisely, conditioned on the field $Y$, the extremal functional shows exactly how the extremal clustering of the (conditional) stochastic volatility field is given in terms of the extremal clustering of the regularly varying field $Z$ and the realization of $Y$. Secondly, we construct two different cluster counting processes on a fixed, full-dimensional set with boundary of Lebesgue measure zero: By means of a coordinate-dependent upscaling of subsets, we systematically count the number of relevant clusters with an extreme observation. We show that both cluster processes converge to a Poisson point process with intensity given in terms of the extremal functional.

Explore related subjects

Keep this discovery

BibTeXRIS

Mads Stehr, Anders Rønn-Nielsen. 2023-01-24. Extremes of regularly varying stochastic volatility fields. https://arxiv.org/abs/2301.10113

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