Metraipolis › archive › dc_c28e28696fc8
fastC-GC and fastC-GC*: Efficient RCCP-Guided Graph Estimation for Time Series — arXiv:2610.37883
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.37883
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-01T02:21:04.644Z
- SHA-256 of the archived text
5fc7eabb345cf61dbe13823f403f1c047604f15d0abaff71d7105c291bf0bf09- Stable URL of this page
https://metraipolis.com/documento/dc_c28e28696fc8
How to cite
fastC-GC and fastC-GC*: Efficient RCCP-Guided Graph Estimation for Time Series — arXiv:2610.37883 — arXiv (en), https://arxiv.org/abs/2610.37883 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c28e28696fc8 (Metraipolis archive dc_c28e28696fc8, sha256 5fc7eabb345cf61dbe13823f403f1c047604f15d0abaff71d7105c291bf0bf09)
BibTeX
@misc{dcc28e28696fc8,
title = {fastC-GC and fastC-GC*: Efficient RCCP-Guided Graph Estimation for Time Series — arXiv:2610.37883},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.37883},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c28e28696fc8; sha256 5fc7eabb345cf61dbe13823f403f1c047604f15d0abaff71d7105c291bf0bf09},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.37883. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We introduce fastC-GC and fastC-GC$^*$, computationally efficient methods for time-series graph estimation using the two-test rule motivated by Reichenbach's common cause principle (RCCP) and the conditioning sets of causalised Granger causality (c-GC and c-GC$^*$). The methods use standardized data, ridge-residual correlation, and complete circular shift enumeration evaluated by Fourier transforms. Shared precision calculations and Schur downdates avoid repeated regression fits. On a single-threaded benchmark, fastC-GC was 68-277 times faster than the compared c-GC implementation, and fastC-GC$^*$ was 192-886 times faster than c-GC$^*$. Across four suites with reference graphs, aggregate mean area under the precision-recall curve (AUPRC) differed from the corresponding baseline by at most 0.019, but F1 was lower at the selected thresholds in every suite. The computational gains therefore accompany a change in estimator and selected graphs. Among eight methods, Bagged PCMCI+ had the highest mean AUPRC on sparse VAR, an autocorrelated structural process, and DREAM3; CUTS+ led on Lorenz-96. Wind-tunnel and river-discharge applications illustrate differences between inferred graphs without establishing causal accuracy. We prove the computational identities and a restricted population adjacency result for fastC-GC$^*$. Causal interpretation requires the stated graphical assumptions; validity of the implemented tests additionally requires a suitable shift-invariant null law. Empirical null rejection rates informed the conditional threshold $\beta = 0.005$, without establishing general test validity or graph-wide error control. Tema degli esploratori: governance digitale e beni comuni (elenco arXiv cs.SI, nuovi lavori del giorno). Categorie arXiv: Computation (stat.CO) ; Social and Information Networks (cs.SI); Econometrics (econ.EM). Pagina del lavoro: https://arxiv.org/abs/2610.37883 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-01T02:11:58.376Z dalla pagina https://arxiv.org/list/cs.SI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).