Author:
Yin Hang,Hou Jishan,Gong Chengju
Abstract
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.
Funder
National Office for Philosophy and Social Sciences
National Natural Science Foundation of China
Subject
General Physics and Astronomy
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献