Abstract:Directed acyclic graphs provide a fundamental tool for representing directed dependence structures in multivariate network data, and are widely used to model financial and economic networks. However, accurate and interpretable estimation remains challenging under graph structural uncertainty. We propose an optimal model averaging method for directed acyclic Gaussian graphs. With a set of candidate models varying by graph structures, we average estimates from candidate models using weights that minimize a penalized negative log-likelihood criterion. In contrast to existing approaches, we not only establish the asymptotic optimality, weight consistency, and parameter consistency of the proposed method, but also explicitly characterize how different candidate models affect the convergence rate. Moreover, we prove parameter consistency even when all candidate graph models are misspecified. Results from simulation studies and a real-data analysis on the banks' international liability data show the promise of the proposed method.
| Comments: | 33 pages, 5 figures |
| Subjects: | Methodology (stat.ME) |
| MSC classes: | 62H22, 62H12, 62R07 |
| Cite as: | arXiv:2605.25496 [stat.ME] |
| (or arXiv:2605.25496v1 [stat.ME] for this version) | |
| https://doi.org/10.48550/arXiv.2605.25496 arXiv-issued DOI via DataCite (pending registration) |
From: Wenhui Li [view email]
[v1]
Mon, 25 May 2026 06:57:18 UTC (105 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。