A node influence ranking algorithm combining k-shell iteration and node degree.
Identifying key nodes in complex networks holds significant application value in fields such as information dissemination and disease spread. The traditional K-shell decomposition method has low time complexity and is suitable for large-scale complex networks; however, it only considers global posit...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Public Library of Science (PLoS)
2025-01-01
|
| Series: | PLoS ONE |
| Online Access: | https://doi.org/10.1371/journal.pone.0328381 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Identifying key nodes in complex networks holds significant application value in fields such as information dissemination and disease spread. The traditional K-shell decomposition method has low time complexity and is suitable for large-scale complex networks; however, it only considers global positional information, leading to lower discrimination. To improve the K-shell decomposition method, many approaches have been proposed by researchers. However, there no algorithm has yet that simultaneously uses the iteration factor and degree to further distinguish nodes with the same K-shell value. To address this issue, we propose a node influence ranking algorithm that integrates K-shell iteration, node degree, and neighbor information, considering both global network position and local topology. Through simulation experiments on eight networks, it was verified that this method provides more accurate ranking results compared to dc, bc, cc, k-shell, Ks + , KSIF, LGI and DCK methods on eight networks, with an average accuracy improvement of 5.15% over the second-best algorithm. In identifying the top 10 key nodes, the KTD algorithm demonstrates higher accuracy than other methods. Additionally, it shows high discriminative power and good time performance, making it suitable for large-scale complex networks. |
|---|---|
| ISSN: | 1932-6203 |