Ranking influential spreaders based on both node k-shell and structural hole

Z Zhao, D Li, Y Sun, R Zhang, J Liu - Knowledge-Based Systems, 2023 - Elsevier
The ranking of individual spreaders aims to measure the influential capability of individual
nodes and is important to control information spreading in a network. However, many …

Disruptive coefficient and 2-step disruptive coefficient: Novel measures for identifying vital nodes in complex networks

AJ Yang, S Deng, H Wang, Y Zhang, W Yang - Journal of Informetrics, 2023 - Elsevier
The identification and ranking of vital nodes in complex networks have been a critical issue
for a long time. In this paper, we present an extension of existing disruptive metrics and …

[HTML][HTML] Identifying the influential nodes in complex social networks using centrality-based approach

U Ishfaq, HU Khan, S Iqbal - Journal of King Saud University-Computer and …, 2022 - Elsevier
Estimating the importance of nodes in complex social networks is significant for
understanding the robustness and stability of a network such as preventing the spread of …

Lss: a locality-based structure system to evaluate the spreader's importance in social complex networks

A Ullah, J Shao, Q Yang, N Khan, CM Bernard… - Expert Systems with …, 2023 - Elsevier
Assessing the importance of spreaders in networks is crucial for investigating the survival
and robustness of networks. There are numerous potential applications, such as preventing …

A novel potential edge weight method for identifying influential nodes in complex networks based on neighborhood and position

L Meng, G Xu, P Yang, D Tu - Journal of Computational Science, 2022 - Elsevier
The identification of influential nodes is one of the most urgent and challenging research
issues in complex networks, which is crucial to the robustness and stability of networks …

A novel algorithm for identifying influential nodes in complex networks based on local propagation probability model

G Xu, L Meng - Chaos, Solitons & Fractals, 2023 - Elsevier
Identifying influential nodes in complex networks is an essential research issue in network
science since it may attribute to understand network structure and function. Majority of …

A new community-based algorithm based on a “peak-slope-valley” structure for influence maximization on social networks

P Yang, L Zhao, Z Lu, L Zhou, F Meng, Y Qian - Chaos, Solitons & Fractals, 2023 - Elsevier
Influence Maximization (IM) is a key algorithmic problem that has been extensively studied
in social influence analysis, but most of existing researches either make sacrifices in solution …

CPR-TOPSIS: A novel algorithm for finding influential nodes in complex networks based on communication probability and relative entropy

C Dong, G Xu, L Meng, P Yang - Physica A: Statistical Mechanics and its …, 2022 - Elsevier
How to evaluate the importance of nodes and identify influential nodes in complex networks
is a very significant research in the field of network science. Most of existing algorithms …

[HTML][HTML] Identifying important nodes in complex networks based on node propagation entropy

Y Yu, B Zhou, L Chen, T Gao, J Liu - Entropy, 2022 - mdpi.com
In recent years, the identification of the essential nodes in complex networks has attracted
significant attention because of their theoretical and practical significance in many …

Vital spreaders identification synthesizing cross entropy and information entropy with Kshell method

TC Tong, Q Dong, JS Sun, Y Jiang - Expert Systems with Applications, 2023 - Elsevier
Identifying vital spreaders of complex networks is a crucial issue that studies the dynamic
processes and analyzes the performance of networks. In this work, we present a new …