跳到正文
← 返回论文列表与筛选
阅读说明

本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。

DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。

本页为预印本版本;arXiv 收录、作者填写的期刊信息以及作者既有发表经历,都不单独证明本篇已接收。作者发表记录按 OpenAlex 身份与完整姓名、本站覆盖期刊 ISSN 及正式卷期核对,只展示已核实例,档案仍可能误合并。

引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。

关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。

分类依据与纠错

AI 根据所提供的论文材料归类:摘要明确研究重尾长记忆线性时间序列及其序列尾部依赖估计,对应时间序列方向。

反馈分类问题

正在核对关联版本…

代码、数据与补充材料

正在核对对应版本的资源…

关注这篇论文的作者
Ioan Scheffel
Marco Oesting
Gilles Stupfler

重尾长记忆线性时间序列中序列尾部依赖估计的中心极限定理

研究问题
重尾且具有长记忆的线性时间序列中,尾部依赖估计如何收敛,使用样本分位数作为随机阈值会怎样影响极限理论?
方法与思路
作者为滑动窗口和随样本量增长的阈值建立两个多元约化原理,处理窗口重叠、非线性变换及高阶矩不存在等困难。
材料陈述的贡献
摘要称得到多个中心极限定理,允许创新项无限方差;阈值一致的约化原理支持随机阈值极端相关图,并揭示不同于短记忆的极限行为。
阅读关注点
核对尾指数、长记忆参数和阈值增长的联合条件,厘清各估计量对应的归一化速率,以及随机阈值一致性结果的适用范围。
阅读边界
这是 arXiv 预印本,同行评审及期刊接收未核实;摘要未列出具体参数区间、收敛速率与极限分布,不能仅凭允许无限方差判断适用性。

原文摘要

We prove multiple central limit theorems for serial tail dependence estimators in heavy-tailed long memory linear time series. The main theoretical tools are two novel multivariate reduction principles for partial sums of heavy-tailed long memory linear time series, subordinated over sliding windows and above a threshold growing with sample size. This requires addressing several substantial difficulties, including handling a nonlinear, sample-size dependent, and multivariate subordination mechanism, the dependence between several overlapping linear processes, and the lack of higher-order moments of the marginal distribution. Despite these obstacles, our assumptions are mild and, in particular, the innovation process is allowed to have infinite variance. A key feature of our theory is that our second reduction principle holds uniformly in the threshold, allowing central limit theory for empirical extremograms with sample quantiles as thresholds. This question has received little attention in the literature on serial extremal dependence estimation even though the version of empirical extremograms with random thresholds is ubiquitous in practice. We compare our results in several respects with those that may be obtained under short-range dependence, thereby discovering markedly different convergence rates and limit laws in our long memory setting.

笔记与分组