A new estimator for LARCH processes

IF 1.2 4区 数学 Q3 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS
Jean-Marc Bardet
{"title":"A new estimator for LARCH processes","authors":"Jean-Marc Bardet","doi":"10.1111/jtsa.12689","DOIUrl":null,"url":null,"abstract":"<p>The aim of this article is to provide a new estimator of parameters for LARCH<math>\n <mrow>\n <mo>(</mo>\n <mi>∞</mi>\n <mo>)</mo>\n </mrow></math> processes, and thus also for LARCH<math>\n <mrow>\n <mo>(</mo>\n <mi>p</mi>\n <mo>)</mo>\n </mrow></math> or GLARCH<math>\n <mrow>\n <mo>(</mo>\n <mi>p</mi>\n <mo>,</mo>\n <mi>q</mi>\n <mo>)</mo>\n </mrow></math> processes. This estimator results from minimizing a contrast leading to a least squares estimator for the absolute values of the process. Strong consistency and asymptotic normality are shown, and convergence occurs at the rate <math>\n <mrow>\n <msqrt>\n <mrow>\n <mi>n</mi>\n </mrow>\n </msqrt>\n </mrow></math> as well in short or long memory cases. Numerical experiments confirm the theoretical results and show that this new estimator significantly outperforms the smoothed quasi-maximum likelihood estimators or weighted least squares estimators commonly used for such processes.</p>","PeriodicalId":49973,"journal":{"name":"Journal of Time Series Analysis","volume":"45 1","pages":"103-132"},"PeriodicalIF":1.2000,"publicationDate":"2023-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Time Series Analysis","FirstCategoryId":"100","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1111/jtsa.12689","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 1

Abstract

The aim of this article is to provide a new estimator of parameters for LARCH ( ) processes, and thus also for LARCH ( p ) or GLARCH ( p , q ) processes. This estimator results from minimizing a contrast leading to a least squares estimator for the absolute values of the process. Strong consistency and asymptotic normality are shown, and convergence occurs at the rate n as well in short or long memory cases. Numerical experiments confirm the theoretical results and show that this new estimator significantly outperforms the smoothed quasi-maximum likelihood estimators or weighted least squares estimators commonly used for such processes.

一种新的LARCH过程估计方法
本文的目的是为LARCH $(\infty)$过程提供一种新的参数估计,从而也为LARCH $(p)$或GLARCH $(p,q)$过程提供一种新的参数估计。这个估计量是通过最小化导致过程绝对值的最小二乘估计量的对比度得到的。强一致性和渐近正态性表明,收敛发生在速率$\sqrt n$以及短或长记忆的情况下。数值实验证实了理论结果,并表明该估计量明显优于光滑拟极大似然估计量或加权最小二乘估计量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Time Series Analysis
Journal of Time Series Analysis 数学-数学跨学科应用
CiteScore
2.00
自引率
0.00%
发文量
39
审稿时长
6-12 weeks
期刊介绍: During the last 30 years Time Series Analysis has become one of the most important and widely used branches of Mathematical Statistics. Its fields of application range from neurophysiology to astrophysics and it covers such well-known areas as economic forecasting, study of biological data, control systems, signal processing and communications and vibrations engineering. The Journal of Time Series Analysis started in 1980, has since become the leading journal in its field, publishing papers on both fundamental theory and applications, as well as review papers dealing with recent advances in major areas of the subject and short communications on theoretical developments. The editorial board consists of many of the world''s leading experts in Time Series Analysis.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信