arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0907.1514cond-mat.dis-nncond-mat.stat-mechphysics.soc-ph
收藏

复杂网络的熵度量:复杂拓扑的信息论

Entropy measures for complex networks: Toward an information theory of complex topologies

Kartik Anand, Ginestra Bianconi

摘要:

网络复杂性的量化是当今复杂系统物理学中的一个基本问题。解决这个问题的一个可能的路线图是通过将信息论的关键概念扩展到网络。在本文中,我们提出了如何定义一个网络系综的香农熵,以及它如何与吉布斯和冯诺伊曼熵的网络系综。我们在这里介绍的数量将发挥至关重要的作用,制定网络的空模型通过最大熵参数,并将有助于推理问题出现在复杂网络领域。

英文摘要:

The quantification of the complexity of networks is, today, a fundamental problem in the physics of complex systems. A possible roadmap to solve the problem is via extending key concepts of information theory to networks. In this paper we propose how to define the Shannon entropy of a network ensemble and how it relates to the Gibbs and von Neumann entropies of network ensembles. The quantities we introduce here will play a crucial role for the formulation of null models of networks through maximum-entropy arguments and will contribute to inference problems emerging in the field of complex networks.

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

↑