Department of Computational and Data Sciences, Indian Institute of Science, Bangalore, 560012, India.
Department of Computer Science and Engineering, National Institute of Technology Durgapur, Durgapur, West Bengal, 713209, India.
Sci Rep. 2021 Jan 26;11(1):2254. doi: 10.1038/s41598-021-81614-9.
Influential spreaders are the crucial nodes in a complex network that can act as a controller or a maximizer of a spreading process. For example, we can control the virus propagation in an epidemiological network by controlling the behavior of such influential nodes, and amplify the information propagation in a social network by using them as a maximizer. Many indexing methods have been proposed in the literature to identify the influential spreaders in a network. Nevertheless, we have notice that each individual network holds different connectivity structures that we classify as complete, incomplete, or in-between based on their components and density. These affect the accuracy of existing indexing methods in the identification of the best influential spreaders. Thus, no single indexing strategy is sufficient from all varieties of network connectivity structures. This article proposes a new indexing method Network Global Structure-based Centrality (ngsc) which intelligently combines existing kshell and sum of neighbors' degree methods with knowledge of the network's global structural properties, such as the giant component, average degree, and percolation threshold. The experimental results show that our proposed method yields a better spreading performance of the seed spreaders over a large variety of network connectivity structures, and correlates well with ranking based on an SIR model used as ground truth. It also out-performs contemporary techniques and is competitive with more sophisticated approaches that are computationally cost.
有影响力的传播者是复杂网络中的关键节点,它们可以作为传播过程的控制器或最大化器。例如,我们可以通过控制这些有影响力的节点的行为来控制传染病网络中的病毒传播,并利用它们作为最大化器来放大社交网络中的信息传播。文献中已经提出了许多索引方法来识别网络中的有影响力的传播者。然而,我们注意到,每个单独的网络都具有不同的连接结构,我们根据它们的组成和密度将其分类为完整、不完整或介于两者之间。这些会影响现有索引方法在识别最佳有影响力的传播者方面的准确性。因此,没有一种单一的索引策略可以适用于所有种类的网络连接结构。本文提出了一种新的索引方法 Network Global Structure-based Centrality (ngsc),它巧妙地结合了现有的 k-shell 和邻居度和方法,并利用了网络的全局结构属性的知识,如巨连通分量、平均度和渗流阈值。实验结果表明,我们提出的方法在各种网络连接结构中,对种子传播者的传播性能更好,并且与作为基准的 SIR 模型的排序相关性很好。它还优于当代技术,并且与计算成本更高的更复杂的方法具有竞争力。