Time series aggregation, disaggregation and long memory
Articles
Dmitrij Celov
Vilnius University
Remigijus Leipus
Vilnius University
Published 2023-09-21
https://doi.org/10.15388/LMR.2006.30723
PDF

Keywords

mixture density
disaggregation
AR(1) aggregation
long memory

How to Cite

Celov, D. and Leipus, R. (2023) “Time series aggregation, disaggregation and long memory”, Lietuvos matematikos rinkinys, 46(spec.), pp. 255–262. doi:10.15388/LMR.2006.30723.

Abstract

Large-scale aggregation and its inverse, disaggregation, problems are important in many fields of studies like macroeconomics, astronomy, hydrology and sociology. It was shown in Granger (1980) that a certain aggregation of random coefficient AR(1) models can lead to long memory output. Dacunha-Castelle and Oppenheim (2001) explored the topic further, answering when and if a predefined long memory process could be obtained as the result of aggregation of a specific class of individual processes.  In this paper,  the disaggregation scheme of Leipus et al.  (2006) is briefly discussed. Then disaggregation into AR(1)  is analyzed further, resulting in a theorem that helps, under corresponding assumptions, to construct a mixture density for a given aggregated by AR(1) scheme process. Finally the theorem is illustrated by FARUMA mixture densityÆs example.

PDF
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Downloads

Download data is not yet available.