arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1706.09570q-bio.NC
收藏

两种综合信息测度的仿真研究

Simulation Study of Two Measures of Integrated Information

Suresh Jois, Nithin Nagaraj

摘要:

背景资料:许多作者基于信息论、格兰杰因果关系和复杂性等理论原理提出了意识的定量理论(QTC)。最近,Virmani和Nagaraj(arXiv:1608.08450v2 [cs.IT])注意到集成信息和压缩复杂性之间的相似性,并在此基础上提出了一种新的网络复杂性度量,称为Phi-Compression Complexity(Phi-C或$Φ^C$)。他们使用布尔网络进行的计算机模拟表明,$Φ^C$与Giulio Tononi等人的综合信息测量$Φ$ 3.0相比毫不逊色,并表现出理想的数学和计算特性。研究方法:在目前的工作中,$Φ^C$被测量为两种类型的模拟网络:(A)网络表示简单的神经元连接图案(图9中的Tononi和Sporns,BMC神经科学4(1),2003);(B)随机网络来自Erdös-R ényi G(N,p)图。所有模拟的代码都是用Python 3.6编写的,并且使用NetworkX库来模拟图形。结果和讨论摘要:在模拟A中,对于同一组网络,$Φ^C$值与IIT 1.0 $Φ$的值以违反直觉的方式不同。看来,$Φ^C$捕捉信息集成,网络拓扑结构,图形组成和节点熵之间的相互作用的一些不变的方面。Virmani和Nagaraj(arXiv:1608.08450v2 [cs.IT])试图强调$Φ^C$和IIT $Φ$之间的相关性,而模拟A的结果强调了两种测量方法在捕获综合信息方面的差异。在模拟B中,模拟A的结果被扩展到更一般的随机网络情况。在结论部分,我们概述了本文的新颖之处,以及我们正在进行的和未来的研究。

英文摘要:

Background: Many authors have proposed Quantitative Theories of Consciousness (QTC) based on theoretical principles like information theory, Granger causality and complexity. Recently, Virmani and Nagaraj (arXiv:1608.08450v2 [cs.IT]) noted the similarity between Integrated Information and Compression-Complexity, and on this basis, proposed a novel measure of network complexity called Phi-Compression Complexity (Phi-C or $Φ^C$). Their computer simulations using Boolean networks showed that $Φ^C$ compares favorably to Giulio Tononi et al's Integrated Information measure $Φ$ 3.0 and exhibits desirable mathematical and computational characteristics. Methods: In the present work, $Φ^C$ was measured for two types of simulated networks: (A) Networks representing simple neuronal connectivity motifs (presented in Fig.9 of Tononi and Sporns, BMC Neuroscience 4(1), 2003); (B) random networks derived from Erdös-R ényi G(N, p)graphs. Code for all simulations was written in Python 3.6, and the library NetworkX was used to simulate the graphs. Results and discussions summary: In simulations A, for the same set of networks, $Φ^C$ values differ from the values of IIT 1.0 $Φ$ in a counter-intuitive manner. It appears that $Φ^C$ captures some invariant aspects of the interplay between information integration, network topology, graph composition and node entropy. While Virmani and Nagaraj (arXiv:1608.08450v2 [cs.IT]) sought to highlight the correlations between $Φ^C$ and IIT $Φ$, the results of simulations A highlight the differences between the two measures in the way they capture the integrated information. In simulations B, the results of simulations A are extended to the more general case of random networks. In the concluding section we outline the novel aspects of this paper, and our ongoing and future research.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑