Causal Discovery in Multivariate Extremes via Tail Asymmetry
利用尾部不对称性发现多元极端事件的因果结构AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
本页为预印本版本;arXiv 收录、作者填写的期刊信息以及作者既有发表经历,都不单独证明本篇已接收。作者发表记录按 OpenAlex 身份与完整姓名、本站覆盖期刊 ISSN 及正式卷期核对,只展示已核实例,档案仍可能误合并。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要明确研究极端事件的因果方向识别,并应用于金融尾部风险传播网络。
利用尾部不对称性发现多元极端事件的因果结构AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Causal discovery in multivariate extremes is challenging because extreme observations are sparse, dependent, and often affected by latent common shocks. Existing approaches focus on undirected extremal dependence, require prior graph restriction, and do not scale beyond small systems. We introduce tail-induced asymmetry as a principle for causal directionality in heavy-tailed systems, where extreme events propagate asymmetrically so that forward tail prediction is systematically easier than backward prediction. We show that this asymmetry yields identifiable causal direction under a canonical max-linear model and provides a basis for score-based structure learning in the tail regime. Building on this, we propose Sparse Structure diScovery in Multivariate Extremes (S3ME), a two-stage data-driven framework for causal discovery. The first stage performs proxy-adjusted penalized neighbourhood selection to recover a sparse candidate skeleton under latent confounding. The second stage orients edges by minimizing tail prediction risk based on max-linear envelope models, exploiting directional asymmetry. We establish high-dimensional guarantees for skeleton screening and consistency of the score-based estimator under population separation conditions. Simulations demonstrate robustness to latent confounding and favourable scaling relative to existing extremal methods. Applications to river network data and financial tail-risk networks show that the approach recovers sparse, interpretable propagation structures without prespecified graph structure.