SearcharxivSearch

arXiv · 1704.06179

Spectral tail processes and max-stable approximations of multivariate regularly varying time series

Abstract

A regularly varying time series as introduced in Basrak and Segers (2009) is a (multivariate) time series such that all finite dimensional distributions are multivariate regularly varying. The extremal behavior of such a process can then be described by the index of regular variation and the so-called spectral tail process, which is the limiting distribution of the rescaled process, given an extreme event at time 0. As shown in Basrak and Segers (2009), the stationarity of the underlying time series implies a certain structure of the spectral tail process, informally known as the "time change formula". In this article, we show that on the other hand, every process which satisfies this property is in fact the spectral tail process of an underlying stationary max-stable process. The spectral tail process and the corresponding max-stable process then provide two complementary views on the extremal behavior of a multivariate regularly varying stationary time series.

Explore related subjects

Keep this discovery

BibTeXRIS

Anja Janßen. 2017-04-20. Spectral tail processes and max-stable approximations of multivariate regularly varying time series. https://arxiv.org/abs/1704.06179

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