Community-based voting approach to enhance the spreading dynamics by identifying a group of influential spreaders in complex networks

• Type: Article in International Scientific Journal
• Date: 2025

Authors

Nandi, S (Author) Other; Malta, MC (Author) FEUP; Maji, G (Author) Other; Dutta, A (Author) Other

Journal

Title: Journal of Computational Science

Vol. 86

ISSN: 1877-7503

Publisher: Elsevier

Indexing

ISI Web of Knowledge - 0 Citations

Scopus - 0 Citations

Other information

Authenticus ID: P-018-2DQ

DOI: 10.1016/j.jocs.2025.102540

Abstract (EN): Exploring a group of influential spreaders to acquire maximum influence has become an emerging area of research in complex network analysis. The main challenge of this research is to identify the group of important nodes that are scattered broadly, such that the propagation ability of information is maximum to a network. Researchers proposed many centrality-based approaches with certain limitations to identify the influential nodes (spreaders) considering different properties of the networks. To find a group of spreaders, the VoteRank (a voting mechanism) based method produces effective results with low time complexity, wherein each iteration, the node votes for its neighbors by its voting capability, and the node obtaining the maximum vote score is identified as an influential spreader. The major loophole of existing VoteRank methods is measuring the voting capability based on the degree, k-shell index, or contribution of neighbors methods, which does not efficiently identify the spreaders from the diverse regions based on their spreading ability. In this paper, we propose a novel Community-based VoteRank method (CVoteRank) to identify a group of influential spreaders from diverse network regions by which the diffusion process is enhanced. Firstly, we measure every node's spreading ability based on intra- and inter-connectivity structure in a community, which signifies the local and global importance of the node. To identify the seed nodes, we assign the spreading ability to that node's voting capability and iteratively calculate the voting score of anode based on its neighboring voting capability and its spreading ability. Then, the node acquiring the maximum voting score is identified as the influential spreader in each iteration. Finally, to solve the problem of influence overlapping, CVoteRank reduces the voting capability of the neighboring nodes of the identified spreader. The efficiency of CVoteRank is evaluated and compared with the different state-of-the-art methods on twelve real networks. Utilizing the stochastic susceptible-infected-recovered epidemic method, we calculate the infected scale, final infected scale, and the average shortest path length among the identified spreaders. The experimental results show that CVoteRank identifies the most efficient spreaders with the highest spreading ability within a short period and the maximum reachability, and the identified spreaders are situated at diverse portions of the networks.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 18