Skip to main content
SpringerLink
Log in

Discovering Sets of Key Players in Social Networks

  • Chapter
  • First Online:
Computational Social Network Analysis

Part of the book series: Computer Communications and Networks ((CCN))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    The use of cliques to model social groups has been criticized by some authors (e.g. [1, 2]) due to the strict mathematical definition of cliques.

  2. 2.

    A similar figure is used in [12].

  3. 3.

    The complexity is calculated assuming that an adjacency matrix is used to represent the graph, other implementations using other more efficient data structure representations perform better.

References

  1. Wasserman S, Faust K (1994) Social network analysis. Cambridge University Press, Cambridge.

    Book  Google Scholar 

  2. Freeman LC (1996) Cliques, galois lattices, and the human structure of social groups. Social Networks 18(3):173–187

    Article  Google Scholar 

  3. Falzon L (2000) Determining groups from the clique structure in large social networks. Social Networks 22(2):159–172

    Article  Google Scholar 

  4. Friedkin NE (1991) Theoretical foundations for centrality measures. Am J Sociol 96(6):1478–1504

    Article  Google Scholar 

  5. Borgatti SP, Everett MG (2006) A graph-theoretic framework for classifying centrality measures. Social Networks 28(4):466–484

    Article  Google Scholar 

  6. Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry 40(1):35–41

    Article  Google Scholar 

  7. Krebs V (2002) Uncloaking terrorist networks.First Monday 7(4). http://firstmonday.org/htbin/cgiwrap/bin/ojs/index.php/fm/article/view/941/863

  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–252

    Google Scholar 

  9. Scott J (2000) Social network analysis: a handbook. Sage, London

    Google Scholar 

  10. Borgatti SP (2004) Centrality and network flow. Social Networks 27(1):55–71

    Article  Google Scholar 

  11. Borgatti SP, Carley K, Krackhardt D (2006) Robustness of centrality measures under conditions of imperfect data. Social Networks 28:124–1364

    Article  Google Scholar 

  12. Borgatti SP (2006) Identifying sets of key players in a network. Comput Math Organ Theory 12(1):21–34

    Article  MATH  Google Scholar 

  13. McCulloh IA, Carley KM (2008) Social network change detection. Technical report, Carnegie Mellon University

    Google Scholar 

  14. Shannon C (1948) A mathematical theory of communication. Bell Syst Tech J 17:379–423, 623–656

    Article  MathSciNet  Google Scholar 

  15. Tutzauer F (2006) Entropy as a measure of centrality in networks characterized by path-transfer flow. Social Networks 29(2):249–265

    Article  Google Scholar 

  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 York

    Google Scholar 

  17. Latora V, Marchiorib M (2003) How the science of complex networks can help developing strategies against terrorism. Chaos Soliton Fract 20(1):69–75

    Article  Google Scholar 

  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–76

    Google Scholar 

  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 http://ssrn.com/abstract=560641

  20. Doyle PG, Snell LT (1984) Random walks and electric networks. Mathematical Association of America, Washington, DC

    MATH  Google Scholar 

  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/Heidelberg

    Google Scholar 

  22. Kamada T, Kawai S (1989) An algorithm for drawing general undirected graphs. Inform Process Lett 31:7–15

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electronic Systems, Esbjerg Institute of Technology, Aalborg University, Aalborg, Denmark

    Daniel Ortiz-Arroyo

Authors
  1. Daniel Ortiz-Arroyo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Daniel Ortiz-Arroyo .

Editor information

Editors and Affiliations

  1. Scientific Network for Innovation &, Machine Intelligence Research Labs (MIR), Auburn, 98071-2259, U.S.A.

    Ajith Abraham

  2. Fac. Computers & Information, Cairo University, Ahmed Zewal Street 5, Giza, 12613, Egypt

    Aboul-Ella Hassanien

  3. Dept. Computer Science, Technical University Ostrava, Tr. 17. Listopadu 15, Ostrava, 708 33, Czech Republic

    Vaclav Sná¿el

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag London Limited

About this chapter

Cite this chapter

Ortiz-Arroyo, D. (2010). Discovering Sets of Key Players in Social Networks. In: Abraham, A., Hassanien, AE., Sná¿el, V. (eds) Computational Social Network Analysis. Computer Communications and Networks. Springer, London. https://doi.org/10.1007/978-1-84882-229-0_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-84882-229-0_2

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84882-228-3

  • Online ISBN: 978-1-84882-229-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation