Search arXivSearch

arXiv · 1509.00253

A large deviations approach to limit theory for heavy-tailed time series

Abstract

In this paper we propagate a large deviations approach for proving limit theory for (generally) multivariate time series with heavy tails. We make this notion precise by introducing regularly varying time series. We provide general large deviation results for functionals acting on a sample path and vanishing in some neighborhood of the origin. We study a variety of such functionals, including large deviations of random walks, their suprema, the ruin functional, and further derive weak limit theory for maxima, point processes, cluster functionals and the tail empirical process. One of the main results of this paper concerns bounds for the ruin probability in various heavy-tailed models including GARCH, stochastic volatility models and solutions to stochastic recurrence equations. 1. Preliminaries and basic motivation In the last decades, a lot of efforts has been put into the understanding of limit theory for dependent sequences, including Markov chains (Meyn and Tweedie [42]), weakly dependent sequences (Dedecker et al. [21]), long-range dependent sequences (Doukhan et al. [23], Samorodnitsky [54]), empirical processes (Dehling et al. [22]) and more general structures (Eberlein and Taqqu [25]), to name a few references. A smaller part of the theory was devoted to limit theory under extremal dependence for point processes, maxima, partial sums, tail empirical processes. Resnick [49, 50] started a systematic study of the relations between the convergence of point processes, sums and maxima, see also Resnick [51] for a recent account. He advocated the use of multivariate regular variation as a flexible tool to describe heavy-tail phenomena combined with advanced continuous mapping techniques. For example, maxima and sums are understood as functionals acting on an underlying point process, if the point process converges these functionals converge as well and their limits are described in terms of the points of the limiting point process. Davis and Hsing [13] recognized the power of this approach for limit theory of point processes, maxima, sums, and large deviations for dependent regularly varying processes, i.e., stationary sequences whose finite-dimensional distributions are regularly varying with the same index. Before [13], limit theory for particular regularly varying stationary sequences was studied for the sample mean, maxima, sample autocovariance and autocorrelation functions of linear and bilinear processes with iid regularly varying noise and extreme value theory was considered for regularly varying ARCH processes and solutions to stochastic recurrence equation, see Rootzén [53], Davis and 1991 Mathematics Subject Classification. Primary 60F10, 60G70, secondary 60F05. Key words and phrases. Large deviation principle, regularly varying processes, central limit theorem, ruin probabilities, GARCH.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

T. Mikosch, O. Wintenberger. 2015-09-01. A large deviations approach to limit theory for heavy-tailed time series. https://doi.org/10.1007/s00440-015-0654-4

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Sample complexity and weak limits of nonsmooth multimarginal Schrödinger system with application to optimal transport barycenter

Multimarginal optimal transport (MOT) has emerged as a useful framework for many applied problems. However, compared to the well-studied classical two-marginal optimal transport theory, analysis of MOT is far more challenging and remains much less developed. In this paper, we study the statistical estimation and inference problems for the entropic MOT (EMOT), whose optimal solution is characterized by the multimarginal Schrödinger system. Assuming only boundedness of the cost function, we derive sharp sample complexity for estimating several key quantities pertaining to EMOT (cost functional and Schrödinger coupling) from point clouds that are randomly sampled from the input marginal distributions. Moreover, with substantially weaker smoothness assumption on the cost function than the existing literature, we derive distributional limits and bootstrap validity of various key EMOT objects. As an application, we propose the multimarginal Schrödinger barycenter as a new and natural way to regularize the exact Wasserstein barycenter and demonstrate its statistical optimality.

math.ST

Nonparametric spectral density estimation using interactive mechanisms under local differential privacy

We study the problem of estimating the spectral density of a centered stationary Gaussian time series under local differential privacy constraints. Specifically, we propose new interactive privacy mechanisms for three tasks: recovering a single covariance coefficient, recovering the spectral density at a fixed frequency, and global recovery. Our approach achieves faster rates through a two-stage process: we first apply the Laplace mechanism to the truncated value, and then use the resulting privatized sample to learn about the dependence mechanism in the time series. For spectral densities belonging to Hölder and Sobolev smoothness classes, we demonstrate that our algorithms improve upon the non-interactive mechanism of Kroll (2024) for small privacy parameter $α$, since the pointwise rates depend on $nα^2$ instead of $nα^4$. Moreover, we show that the rate $(nα^4)^{-1}$ is optimal for estimating a covariance coefficient with non-interactive mechanisms. However, the $L_2$ rate of our interactive estimator is slower than the pointwise rate. We show how to use these procedures to provide a bona fide locally differentially private estimator of the entire covariance matrix. A simulation study validates our findings.

math.ST

Estimating eigenvectors and eigenspaces of covariance matrices: Optimal Bounds and Conditions for Consistency

Let $X = [ ξ_1, \,\, ξ_2,...\,\, ,ξ_d]^\top$ be a zero-mean random vector of large dimension $d$ ($d \rightarrow \infty$) with (hidden) covariance matrix $M = (m_{ij})_{1 \leq i, j \leq d},$ where $m_{ij} = m_{ji} = \textbf{Cov}(ξ_i, ξ_j).$ Let $X_1, X_2, \dots, X_n$ be $n$ iid samples of $X$. Consider the sample covariance matrix $$\textstyle \tilde{M} := \frac{1}{n} \sum_{i=1}^{n} X_i X_i^\top.$$ In practice, one frequently uses the eigenvectors and eigenspaces of $\tilde M$ as estimators for those of $M$. A central task is to provide an error analysis for these estimators. In this paper, we provide an optimal error analysis, obtaining upper and lower bounds of matching order of magnitude, for a wide range of parameters $d$ and $n$, under mild assumptions on $M$. As corollaries, we obtain new necessary and sufficient conditions for the consistency of the estimators. In these conditions, we only require the number of samples $n$ to depend linearly on the effective rank of $M$, which can be much smaller than the dimension $d$.

math.ST