arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0707.0756physics.soc-phcond-mat.stat-mech
收藏

复杂网络中的可通信性

Communicability in complex networks

Ernesto Estrada, Naomichi Hatano

摘要:

复杂网络的许多拓扑和动力学性质都是通过假设网络上的大部分传输流沿着最短路径流动来定义的。然而,存在使用非最短路径到达网络目的地的不同场景。因此,只考虑最短路径并不能说明复杂网络的全局可通信性。本文提出了一种新的复杂网络可通信性测度,它是最短路径概念的广义推广,根据这种测度,现实世界中的大多数网络都表现出最大连通度(最流行的)节点之间的可通信性(可通信性)。也有几个网络具有离散的可通信性,其中最“流行”的节点彼此之间的通信非常差。利用这些信息,我们将现实世界中各种各样的复杂系统根据它们的结构-动力学相关性分为少量的通用类。此外,新的可通信性度量能够区分网络的更精细结构,例如网络划分的社区。社区在这里被明确地定义为一组节点,它们之间的通信能力比网络中的其他节点更强。

英文摘要:

Many topological and dynamical properties of complex networks are defined by assuming that most of the transport on the network flows along the shortest paths. However, there are different scenarios in which non-shortest paths are used to reach the network destination. Thus the consideration of the shortest paths only does not account for the global communicability of a complex network. Here 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 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 nodes in the network.

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

↑