Abstract
Identifying critical nodes is an efficient strategy for preventing the dynamics of risk dissemination. The properties of edges connecting to the removed nodes are assumed to be the same by many decomposition methods. However, the edge weights are always different in weighted social networks since they have certain practical implications. In this study, a mixed strength decomposition (MSD) method is proposed to identify critical nodes in weighted social networks. This method aims to address the issue of not accounting for the information on removed nodes by considering both residual strength and exhausted strength. Three experimental analyses —the monotonicity test, Susceptible-Infected (SI) diffusion simulation, and successive node removal experiments— conducted on six real-world networks demonstrate that the MSD method has a competitive performance in identifying critical nodes, which overcomes the instability of the node strength and the degeneracy of the s-core 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 callDisclaimer: 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.
