Finding Influential Nodes in Complex Networks Using KL Divergence
Author Information
Author(s): Wang Guan, Sun Zejun, Wang Tianqin, Li Yuanzhe, Hu Haifeng
Primary Institution: School of Information Engineering, Pingdingshan University
Hypothesis
The KLN algorithm can effectively identify influential nodes in complex networks by evaluating the damage influence of node removal.
Conclusion
The KLN algorithm demonstrates better accuracy and applicability in identifying influential nodes across various network scales compared to existing algorithms.
Supporting Evidence
- The KLN algorithm was validated against 11 other algorithms on 10 networks.
- Experimental results indicate that KLN effectively evaluates the importance of nodes.
- KLN shows superior performance in identifying influential nodes compared to classical and recent algorithms.
Takeaway
This study shows how to find important points in a network, like figuring out which friends are best at spreading a rumor, using a special math method.
Methodology
The KLN algorithm evaluates the loss of information entropy after node removal and assesses the damage influence of the removed node by integrating network attributes.
Limitations
The study primarily focuses on the performance of the KLN algorithm without extensive exploration of other potential factors affecting node influence.
Digital Object Identifier (DOI)
Want to read the original?
Access the complete publication on the publisher's website