Abstract
Identifying the influential nodes to fragment a network is of significant importance in hindering the spread of epidemics and maximizing the influence of advertisements. Here, we address the problem by minimizing the largest eigenvalue of the non-backtracking matrices of networks, based on which a novel method is proposed to identify the optimal influential nodes. Interestingly, the proposed method could find some particular nodes to fragment complex networks. Experiments in real networks demonstrate the effectiveness of the proposed method.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Statistical Mechanics: Theory and Experiment
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
