publication . Article . Other literature type . 2006

identifying sets of key players in a social network

Borgatti, Stephen P.;
Restricted
  • Published: 01 Apr 2006 Journal: Computational and Mathematical Organization Theory, volume 12, pages 21-34 (issn: 1381-298X, eissn: 1572-9346, Copyright policy)
  • Publisher: Springer Science and Business Media LLC
Abstract
A procedure is described for finding sets of key players in a social network. A key assumption is that the optimal selection of key players depends on what they are needed for. Accordingly, two generic goals are articulated, called KPP-POS and KPP-NEG. KPP-POS is defined as the identification of key players for the purpose of optimally diffusing something through the network by using the key players as seeds. KPP-NEG is defined as the identification of key players for the purpose of disrupting or fragmenting the network by removing the key nodes. It is found that off-the-shelf centrality measures are not optimal for solving either generic problem, and therefore ...
Subjects
free text keywords: Modelling and Simulation, General Decision Sciences, General Computer Science, Applied Mathematics, Computational Mathematics, Computer science, Network science, Knowledge management, business.industry, business, Centrality, Cohesion (chemistry), Social network
Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue