Information-theoretic approach to network modularity.
Information-theoretic approach to network modularity.
复制标题
DOI：
10.1103/physreve.71.046117
复制
发表时间：
2004-11
期刊：
影响因子：
--
通讯作者：
E. Ziv;Manuel Middendorf;C. Wiggins
中科院分区：
文献类型：
--
作者：
E. Ziv;Manuel Middendorf;C. Wiggins
利用信息论的最新发展，我们提出、说明并验证了一种原则性的信息论算法，用于模块发现和由此产生的网络模块化度量。该度量是一个顺序参数（0到1之间的无量纲数）。与其他模块发现和量化网络模块化（使用蒙特卡罗生成Erdös-like模块化网络）的方法进行了比较。最后，将网络信息瓶颈（NIB）算法应用于许多现实世界的网络，包括2004年APS 3月会议上共同作者的“社交”网络。
Exploiting recent developments in information theory, we propose, illustrate, and validate a principled information-theoretic algorithm for module discovery and the resulting measure of network modularity. This measure is an order parameter (a dimensionless number between 0 and 1). Comparison is made with other approaches to module discovery and to quantifying network modularity (using Monte Carlo generated Erdös-like modular networks). Finally, the network information bottleneck (NIB) algorithm is applied to a number of real world networks, including the "social" network of co-authors at the 2004 APS March Meeting.