Discovering Sets of Key Players in Social Networks

  • Daniel Ortiz-Arroyo
Part of the Computer Communications and Networks book series (CCN)


The discovery of single key players in social networks is commonly done using some of the centrality measures employed in social network analysis. However, few methods, aimed at discovering sets of key players, have been proposed in the literature. This chapter presents a brief survey of such methods. The methods described include a variety of techniques ranging from those based on traditional centrality measures using optimizing criteria to those based on measuring the efficiency of a network. Additionally, we describe and evaluate a new approach to discover sets of key players based on entropy measures. Finally, this chapter presents a brief description of some applications of information theory within social network analysis.


Social Network Short Path Social Network Analysis Centrality Measure Entropy Measure 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Wasserman S, Faust K (1994) Social network analysis. Cambridge University Press, Cambridge.CrossRefGoogle Scholar
  2. 2.
    Freeman LC (1996) Cliques, galois lattices, and the human structure of social groups. Social Networks 18(3):173–187CrossRefGoogle Scholar
  3. 3.
    Falzon L (2000) Determining groups from the clique structure in large social networks. Social Networks 22(2):159–172CrossRefGoogle Scholar
  4. 4.
    Friedkin NE (1991) Theoretical foundations for centrality measures. Am J Sociol 96(6):1478–1504CrossRefGoogle Scholar
  5. 5.
    Borgatti SP, Everett MG (2006) A graph-theoretic framework for classifying centrality measures. Social Networks 28(4):466–484CrossRefGoogle Scholar
  6. 6.
    Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry 40(1):35–41CrossRefGoogle Scholar
  7. 7.
    Krebs V (2002) Uncloaking terrorist networks.First Monday 7(4).
  8. 8.
    Borgatti SP (2003) The key player problem. In: Breiger R, Carley K, Pattison P (eds) In dynamic social network modeling and analysis: workshop summary and papers. National Academy of Sciences Press, Washington, DC, pp 241–252Google Scholar
  9. 9.
    Scott J (2000) Social network analysis: a handbook. Sage, LondonGoogle Scholar
  10. 10.
    Borgatti SP (2004) Centrality and network flow. Social Networks 27(1):55–71CrossRefGoogle Scholar
  11. 11.
    Borgatti SP, Carley K, Krackhardt D (2006) Robustness of centrality measures under conditions of imperfect data. Social Networks 28:124–1364CrossRefGoogle Scholar
  12. 12.
    Borgatti SP (2006) Identifying sets of key players in a network. Comput Math Organ Theory 12(1):21–34CrossRefzbMATHGoogle Scholar
  13. 13.
    McCulloh IA, Carley KM (2008) Social network change detection. Technical report, Carnegie Mellon UniversityGoogle Scholar
  14. 14.
    Shannon C (1948) A mathematical theory of communication. Bell Syst Tech J 17:379–423, 623–656CrossRefMathSciNetGoogle Scholar
  15. 15.
    Tutzauer F (2006) Entropy as a measure of centrality in networks characterized by path-transfer flow. Social Networks 29(2):249–265CrossRefGoogle Scholar
  16. 16.
    Shetty J, Adibi J (2005) Discovering important nodes through graph entropy the case of enron email database. In: LinkKDD ’05: Proceedings of the 3rd international workshop on Link discovery. ACM, New YorkGoogle Scholar
  17. 17.
    Latora V, Marchiorib M (2003) How the science of complex networks can help developing strategies against terrorism. Chaos Soliton Fract 20(1):69–75CrossRefGoogle Scholar
  18. 18.
    Everett MG, Borgatti SP (2005) Extending centrality. In: Carrington P, Scott J, Wasserman S (eds) Models and methods in social network analysis. Cambridge University Press 28:57–76Google Scholar
  19. 19.
    Ballester C, Calvo-Armengol A, Zenou Y (2005) Who’s Who in Networks Wanted - The Key Player. CEPR Discussion Paper No. 5329. Centre for Economic Policy Research, London. Available at
  20. 20.
    Doyle PG, Snell LT (1984) Random walks and electric networks. Mathematical Association of America, Washington, DCzbMATHGoogle Scholar
  21. 21.
    Solé RV, Valverde S (2004) Information theory of complex networks: on evolution and architectural constraints. In: Lecture notes in physics, vol 650, pp 189–207. Springer, Berlin/HeidelbergGoogle Scholar
  22. 22.
    Kamada T, Kawai S (1989) An algorithm for drawing general undirected graphs. Inform Process Lett 31:7–15CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag London Limited 2010

Authors and Affiliations

  1. 1.Department of Electronic SystemsEsbjerg Institute of Technology, Aalborg UniversityAalborgDenmark

Personalised recommendations