摘要翻译：
复杂网络的许多拓扑和动力学性质都是通过假设网络上的大部分传输沿着最短路径流动来定义的。但是，有不同的场景使用非最短路径到达网络目的地。因此，只考虑最短路径并不能考虑复杂网络的全局可通信性。本文提出了一种新的度量复杂网络可通信性的方法，它是最短路径概念的广义推广。根据新的度量，大多数现实世界的网络在网络中连接最多（最流行）的节点之间表现出最大的可通信性（分类可通信性）。也有几个网络具有不协调的可通信性，其中最“流行”的节点之间的通信非常差。利用这些信息，我们根据系统的结构动态相关性，将一组不同的现实复杂系统划分为少量的普适类。此外，新的可通信性度量能够区分网络的更精细的结构，例如网络被划分成的社区。在这里，社区被明确定义为一组节点，它们之间的可通信性比网络中其他节点的可通信性大。
---
英文标题：
《Communicability in complex networks》
---
作者：
Ernesto Estrada and Naomichi Hatano
---
最新提交年份：
2007
---
分类信息：

一级分类：Physics        物理学
二级分类：Physics and Society        物理学与社会
分类描述：Structure, dynamics and collective behavior of societies and groups (human or otherwise). Quantitative analysis of social networks and other complex networks. Physics and engineering of infrastructure and systems of broad societal impact (e.g., energy grids, transportation networks).
社会和团体（人类或其他）的结构、动态和集体行为。社会网络和其他复杂网络的定量分析。具有广泛社会影响的基础设施和系统（如能源网、运输网络）的物理和工程。
--
一级分类：Physics        物理学
二级分类：Statistical Mechanics        统计力学
分类描述：Phase transitions, thermodynamics, field theory, non-equilibrium phenomena, renormalization group and scaling, integrable models, turbulence
相变，热力学，场论，非平衡现象，重整化群和标度，可积模型，湍流
--

---
英文摘要：
  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.
---
PDF链接：
https://arxiv.org/pdf/707.0756