LRIT, URAC No 29, Rabat IT Center, Mohammed V University in Rabat, Rabat, Morocco.
DISP Laboratory, University of Lyon 2, Lyon, France.
Sci Rep. 2020 Sep 23;10(1):15539. doi: 10.1038/s41598-020-71876-0.
Network science provides effective tools to model and analyze complex systems. However, the increasing size of real-world networks becomes a major hurdle in order to understand their structure and topological features. Therefore, mapping the original network into a smaller one while preserving its information is an important issue. Extracting the so-called backbone of a network is a very challenging problem that is generally handled either by coarse-graining or filter-based methods. Coarse-graining methods reduce the network size by grouping similar nodes, while filter-based methods prune the network by discarding nodes or edges based on a statistical property. In this paper, we propose and investigate two filter-based methods exploiting the overlapping community structure in order to extract the backbone in weighted networks. Indeed, highly connected nodes (hubs) and overlapping nodes are at the heart of the network. In the first method, called "overlapping nodes ego backbone", the backbone is formed simply from the set of overlapping nodes and their neighbors. In the second method, called "overlapping nodes and hubs backbone", the backbone is formed from the set of overlapping nodes and the hubs. For both methods, the links with the lowest weights are removed from the network as long as a backbone with a single connected component is preserved. Experiments have been performed on real-world weighted networks originating from various domains (social, co-appearance, collaboration, biological, and technological) and different sizes. Results show that both backbone extraction methods are quite similar. Furthermore, comparison with the most influential alternative filtering method demonstrates the greater ability of the proposed backbones extraction methods to uncover the most relevant parts of the network.
网络科学为建模和分析复杂系统提供了有效的工具。然而,为了理解它们的结构和拓扑特征,真实世界网络的规模不断增大成为一个主要的障碍。因此,将原始网络映射到一个较小的网络,同时保留其信息,是一个重要的问题。提取网络的所谓骨干是一个非常具有挑战性的问题,通常通过粗粒度或基于滤波器的方法来处理。粗粒度方法通过将相似的节点分组来减小网络的大小,而基于滤波器的方法则通过根据统计属性丢弃节点或边来修剪网络。在本文中,我们提出并研究了两种基于滤波器的方法,利用重叠社区结构来提取加权网络中的骨干。实际上,高度连接的节点(枢纽)和重叠节点是网络的核心。在第一种方法中,称为“重叠节点自我骨干”,骨干由重叠节点及其邻居组成。在第二种方法中,称为“重叠节点和枢纽骨干”,骨干由重叠节点和枢纽组成。对于这两种方法,只要保留一个单连通组件的骨干,就从网络中删除具有最低权重的链接。实验是在来自不同领域(社交、共同出现、协作、生物和技术)和不同大小的真实加权网络上进行的。结果表明,这两种骨干提取方法非常相似。此外,与最具影响力的替代过滤方法的比较表明,所提出的骨干提取方法能够更好地揭示网络中最相关的部分。