Statistical inference for Levy-driven graph supOU processes: From short- to long-memory in high-dimensional time series
Shreya Mehta, Almut E. D. Veraart
TL;DR
We introduce Levy-driven graph supOU processes to model high-dimensional time series with graph-structured dependencies, enabling a smooth transition between short- and long-memory regimes and flexible marginals. The approach relies on a drift parametrisation $Q(\theta)=-\bigl(I_d+ c\bar{A}^T\bigr)\theta_2$ and two mixing specifications for $\pi(\theta_2)$: a sum of exponentials or a Gamma law, which control memory properties. An inference framework based on the generalized method of moments (GMM) is developed, featuring a two-step procedure to identify the mixing component and $c$ from the scaled autocovariance and then recover the Lévy-basis moments; asymptotic theory covers consistency and normality under weak dependence. The method is validated by simulations and applied to wind capacity factors in Europe, demonstrating practical usefulness and competitive finite-sample performance, with accompanying software release.
Abstract
This article introduces Levy-driven graph supOU processes, offering a parsimonious parametrisation for high-dimensional time-series, where dependencies between the individual components are governed via a graph structure. Specifically, we propose a model specification that allows for a smooth transition between short- and long-memory settings while accommodating a wide range of marginal distributions. We further develop an inference procedure based on the generalised method of moments, establish its asymptotic properties and demonstrate its strong finite sample performance through a simulation study. Finally, we illustrate the practical relevance of our new model and estimation method in an empirical study of wind capacity factors in an European electricity network context.
