arXiv 1306.33012013-06-14math.STstat.TH

Aggregation and long memory: recent developments

Remigijus Leipus, Anne Philippe, Donata Puplinskaite, Donatas Surgailis

英文摘要：

It is well-known that the aggregated time series might have very different properties from those of the individual series, in particular, long memory. At the present time, aggregation has become one of the main tools for modelling of long memory processes. We review recent work on contemporaneous aggregation of random-coefficient AR(1) and related models, with particular focus on various long memory properties of the aggregated process.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Time series aggregation, disaggregation and long memory

We study the aggregation/disaggregation problem of random parameter AR(1) processes and its relation to the long memory phenomenon. We give a characterization of a subclass of aggregated processes which can be obtained from simpler, "elementary", cases. In particular cases of the mixture densities, the structure (moving average representation) of the aggregated process is investigated.

2007-02-27math.STstat.TH

Long-memory process and aggregation of AR(1) stochastic processes: A new characterization

Contemporaneous aggregation of individual AR(1) random processes might lead to different properties of the limit aggregated time series, in particular, long memory (Granger, 1980). We provide a new characterization of the series of autoregressive coefficients, which is defined from the Wold representation of the limit of the aggregate stochastic process, in the presence of long-memory features. Especially the infinite autoregressive stochastic process defined by the almost sure representation of the aggregate process has a unit root in the presence of the long-memory property. Finally we discu…

2015-08-08math.CVmath.PRmath.ST

Aggregation of isotropic autoregressive fields

This note constitutes a corrigendum to the article of Azomahou, JSPI, 139:2581-2597. The aggregation of isotropic four nearest neighbors autoregressive models on the lattice, with random coefficient, is investigated. The spectral density of the resulting random field is studied in details for a large class of law of the AR coefficient. Depending on this law, the aggregated field may exhibit short memory or isotropic long memory.

2011-06-14math.PRmath.STstat.TH

Inference of seasonal long-memory aggregate time series

Time-series data with regular and/or seasonal long-memory are often aggregated before analysis. Often, the aggregation scale is large enough to remove any short-memory components of the underlying process but too short to eliminate seasonal patterns of much longer periods. In this paper, we investigate the limiting correlation structure of aggregate time series within an intermediate asymptotic framework that attempts to capture the aforementioned sampling scheme. In particular, we study the autocorrelation structure and the spectral density function of aggregates from a discrete-time process.…

2012-11-23math.STstat.TH

Aggregation of autoregressive processes and long memory

We study the aggregation of AR processes and generalized Ornstein-Uhlenbeck (OU) processes. Mixture of spectral densities with random poles are the main tool. In this context, we apply our results for the aggregation of doubly stochastic interactives processes, see Dacunha-Castelle and Fermin (2006). Thus, we study the relationship between aggregation of autoregressive processes and long memory considering complex interaction structures. We precise a very interesting qualitative phenomena: how the long memory creation depends on the poles concentration near to the boundary of stability (measur…

2008-11-12math.PRmath.STstat.TH

Reducing climate risk in energy system planning: a posteriori time series aggregation for models with storage

The growth in variable renewables such as solar and wind is increasing the impact of climate uncertainty in energy system planning. Addressing this ideally requires high-resolution time series spanning at least a few decades. However, solving capacity expansion planning models across such datasets often requires too much computing time or memory. To reduce computational cost, users often employ time series aggregation to compress demand and weather time series into a smaller number of time steps. Methods are usually a priori, employing information about the input time series only. Recent studi…

2022-10-15stat.AP

更多相关论文收起更多论文

非分数记忆：滤波、反持续性与预测

Nonfractional Memory: Filtering, Antipersistence, and Forecasting

本文针对分数差分与实际长记忆缺乏理论联系的问题，提出基于截面聚合生成并预测长记忆的快速算法，揭示其无负阶反持续性并影响频域检验，同时评估高阶 AR 与 ARFIMA 的预测表现。

2018-01-20econ.EMmath.STstat.TH

Disaggregation of Long Memory Processes on C^{\infty} Class

We prove that a large set of long memory (LM) processes (including classical LM processes and all processes whose spectral densities have a countable number of singularities controlled by exponential functions) are obtained by an aggregation procedure involving short memory (SM) processes whose spectral densities are infinitely differentiable (C^{infty}). We show that the C^{infty} class of spectral densities is the optimal class to get a general result for disaggregation of LM processes in SM processes, in the sense that the result given in C^{infty} class cannot be improved taking for instan…

2005-09-14math.PRmath.STstat.TH