Canlı Usta Özge, Bollt Erik M
Department of Electrical and Computer Engineering, Clarkson University, 8 Clarkson Ave., Potsdam, NY 13699, USA.
Clarkson Center for Complex Systems Science, Clarkson University, 8 Clarkson Ave., Potsdam, NY 13699, USA.
Entropy (Basel). 2024 Nov 28;26(12):1030. doi: 10.3390/e26121030.
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.
确定因果推断在物理和工程应用中已变得流行起来。虽然这个问题面临巨大挑战,但它提供了一种通过观察时间序列对复杂网络进行建模的方法。在本文中,我们提出了最优条件相关维度几何信息流原理(oGeoC),该原理可以通过几何解释揭示网络中的直接和间接因果关系。我们引入了两种利用oGeoC原理来发现直接链接并去除间接链接的算法。使用耦合逻辑网络对这些算法进行了评估。结果表明,当观测数量足够时,所提出的算法在识别直接因果链接方面具有很高的准确性,且误报率较低。