Fractal Conditional Correlation Dimension Infers Complex Causal Networks

Determining causal inference has become popular in physical and engineering applications. While the problem has immense challenges, it provides a way to model the complex networks by observing the time series. In this paper, we present the optimal conditional correlation dimensional geometric information flow principle (oGeoC) that can reveal direct and indirect causal relations in a network through geometric interpretations. We introduce two algorithms that utilize the oGeoC principle to discover the direct links and then remove indirect links. The algorithms are evaluated using coupled logistic networks. The results indicate that when the number of observations is sufficient, the proposed algorithms are highly accurate in identifying direct causal links and have a low false positive rate.

Authors

Institutions

Publication Details

Journal
Entropy
Published
2024-11-28
DOI
https://doi.org/10.3390/e26121030
Citations
1
Primary Topic
Complex Systems and Time Series Analysis
Type
article
Field-Weighted Citation Impact
1.13

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Fractal Conditional Correlation Dimension Infers Complex Causal Networks

Erik M. Bollt, Özge Canlı Usta
1 citations
Entropy
Complex Systems and Time Series Analysis
1.13
article

Fractal Conditional Correlation Dimension Infers Complex Causal Networks

Erik M. Bollt, Özge Canlı Usta
article en
1 citations

Abstract

Determining causal inference has become popular in physical and engineering applications. While the problem has immense challenges, it provides a way to model the complex networks by observing the time series. In this paper, we present the optimal conditional correlation dimensional geometric information flow principle (oGeoC) that can reveal direct and indirect causal relations in a network through geometric interpretations. We introduce two algorithms that utilize the oGeoC principle to discover the direct links and then remove indirect links. The algorithms are evaluated using coupled logistic networks. The results indicate that when the number of observations is sufficient, the proposed algorithms are highly accurate in identifying direct causal links and have a low false positive rate.

EntropyVol. 26(12)
Clarkson University (US), Dokuz Eylül University (TR)
National Institutes of Health, Defense Advanced Research Projects Agency, Office of Naval Research, Army Research Office
Openalex Percentile: Top 11%
Complex Systems and Time Series Analysis
1.13
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.