Computational & Mathematical Organization Theory

, Volume 12, Issue 1, pp 21–34

Identifying sets of key players in a social network

Article

DOI: 10.1007/s10588-006-7084-x

Cite this article as:
Borgatti, S.P. Comput Math Organiz Theor (2006) 12: 21. doi:10.1007/s10588-006-7084-x

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 networksCentralityCohesion

Copyright information

© Springer Science + Business Media, Inc. 2006

Authors and Affiliations

  1. 1.Department of Organization StudiesBoston CollegeBoston