Skip to main content
Article
Identifying sets of key players in a social network
Computational & Mathematical Organization Theory (2006)
  • Stephen P. Borgatti, Boston College
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 new measures are presented.
Keywords
  • Social networks,
  • Centrality,
  • Cohesion
Publication Date
April, 2006
Citation Information
Stephen P. Borgatti. "Identifying sets of key players in a social network" Computational & Mathematical Organization Theory Vol. 12 Iss. 1 (2006)
Available at: http://works.bepress.com/steveborgatti/48/