Identifying sets of key players in a social network
- 3.7k Downloads
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.
KeywordsSocial networks Centrality Cohesion
Unable to display preview. Download preview PDF.
- Borgatti SP (2002) Stopping terrorist networks: Can social network analysis really contribute? Sunbelt International Social Networks Conference 13–17. New OrleansGoogle Scholar
- Borgatti MG, Jones C, Everett MG (1998) Network measures of social capital. Connections 21(2):27–36Google Scholar
- Burt RS (1992) Structural Holes: The social structure of competition. Harvard University Press, CambridgeGoogle Scholar
- Coleman J (1990) Foundations of social theory. Belknap Press, Cambridge, MAGoogle Scholar
- Friedkin NE (1991) Theoretical foundations for centrality measures. American Journal of Sociology 96:1478–504Google Scholar
- Holland J (1975) Adaptation in natural and artificial systems. University of Michigan PressGoogle Scholar
- Kernighan BW, Lin S (1970) Efficient heuristic procedure for partitioning graphs. Bell Systems Technical Journal 49(2):291–297Google Scholar
- Krebs V (2002) Uncloaking terrorist networks. First Monday 7(4) http://www.firstmonday.dk/issues/ issue7_/krebs/index.html
- Seidman S (1983) Network structure and minimum degree. Social Networks 5:269–287Google Scholar