Communicability in complex networks
Communicability in complex networks
复制标题
DOI：
10.1103/physreve.77.036111
复制
发表时间：
2008-03-01
影响因子：
2.4
通讯作者：
Hatano, Naomichi
中科院分区：
文献类型：
--
作者：
Estrada, Ernesto;Hatano, Naomichi
本文提出了一种新的复杂网络可通信性测度，它是最短路径概念的广义推广，根据新测度，大多数现实世界的网络都表现出最大连通度（最流行）节点之间的最大可通信性（可通信性）。也有几个网络具有离散的可通信性，其中最“流行”的节点彼此之间的通信非常差。利用这些信息，我们根据结构动态相关性将一组不同的现实世界复杂系统分类为少量的通用类。此外，新的可通信性度量能够区分网络的更精细结构，例如网络划分的社区。社区在这里被明确地定义为一组节点，它们之间的通信能力比网络中的其他节点更强。
We propose a new measure of the communicability of a complex network, which is a broad generalization of the concept of the shortest path. According to the new measure, most of the real-world networks display the largest communicability between the most connected (popular) nodes of the network (assortative communicability). There are also several networks with the disassortative communicability, where the most "popular" nodes communicate very poorly to each other. Using this information we classify a diverse set of real-world complex systems into a small number of universality classes based on their structure-dynamic correlation. In addition, the new communicability measure is able to distinguish finer structures of networks, such as communities into which a network is divided. A community is unambiguously defined here as a set of nodes displaying larger communicability among them than to the rest of the nodes in the network.