Papers › Statistical inference for Levy-driven graph supOU processes: From short- to...
Statistical inference for Levy-driven graph supOU processes: From short- to long-memory in high-dimensional time series
Shreya Mehta, Almut E. D. Veraart
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
This article introduces Levy-driven graph supOU processes, a parsimonious parametrisation for high-dimensional time series in which dependence between components is governed by a graph structure. Specifically, the model bridges short- and long-range dependence within a single parametric family while accommodating a wide range of marginal distributions. We further develop a generalised method of moments estimator, establish its consistency and asymptotic normality, and assess its finite-sample performance through a simulation study. Finally, we illustrate the practical relevance of our model and estimation method in an empirical study of wind capacity factors in a European electricity network context.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections