{"title":"时间序列聚合、分解和长记忆","authors":"Dmitrij Celov, Remigijus Leipus","doi":"10.15388/lmr.2006.30723","DOIUrl":null,"url":null,"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.","PeriodicalId":33611,"journal":{"name":"Lietuvos Matematikos Rinkinys","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Time series aggregation, disaggregation and long memory\",\"authors\":\"Dmitrij Celov, Remigijus Leipus\",\"doi\":\"10.15388/lmr.2006.30723\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":33611,\"journal\":{\"name\":\"Lietuvos Matematikos Rinkinys\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-09-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Lietuvos Matematikos Rinkinys\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.15388/lmr.2006.30723\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Lietuvos Matematikos Rinkinys","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15388/lmr.2006.30723","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
大规模聚集及其逆向分解问题是宏观经济学、天文学、水文学和社会学等诸多研究领域的重要问题。Granger(1980)表明,随机系数AR(1)模型的一定聚合可以导致长记忆输出。Dacunha-Castelle和Oppenheim(2001)进一步探讨了这一主题,回答了何时以及是否可以通过特定类别的单个过程的聚合获得预定义的长记忆过程。本文简要讨论了Leipus et al.(2006)的分解方案。然后进一步分析分解为AR(1),得到一个定理,该定理有助于在相应的假设下构造给定AR(1)方案聚合过程的混合密度。最后用FARUMA混合densityÆs实例说明了该定理。
Time series aggregation, disaggregation and long memory
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.