title: An algorithm for critical nodes problem in social networks based on Owen value.
abstract: Discovering critical nodes in social networks has many important applications. For finding out the critical nodes and considering the widespread community structure in social networks, we obtain each node's marginal contribution by Owen value. And then we can give a method for the solution of the critical node problem. We validate the feasibility and effectiveness of our method on two synthetic datasets and six real datasets. At the same time, the result obtained by using our method to analyze the terrorist network is in line with the actual situation.
authors.affiliation: Department of Computer Science, East China University of Political Science and Law, Shanghai 201620, China ; Department of Computer Science, University College London (UCL), London WC1E 6BT, UK.
authors.forename: Xue-Guang
authors.initials: XG
authors.lastname: Wang
mesh_terms: D000465:Algorithms; D008962:Models, Theoretical; D060756:Social Networking