Abstract
This paper presents an application of information theory to identify sets of key players in social networks. First, we define two entropy measures that we use to analyze the structural properties of a social network. Then, we propose a new method aimed at finding a set of key players that solves the KPP-Neg and KPP-Pos problems. Our preliminary experimental results indicate that the entropy measures can be used effectively to identify a set of key players in a social network.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Friedkin, N.E.: Theoretical foundations for centrality measures. The American Journal of Sociology 96(6), 1478–1504 (1991)
Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry 40(1), 35–41 (1977)
Borgatti, S.P.: Centrality and network flow. Social Networks 27(1), 55–71 (2004)
Krebs, V.: Uncloaking terrorist networks. First Monday 7(4) (2002)
Shannon, C.: A mathematical theory of communication. Bell System Technical Journal 17, 379–423, 623–656 (1948)
Borgatti, S.P., Carley, K., Krackhardt, D.: Robustness of centrality measures under conditions of imperfect data. Social Networks 28, 124–136 (2006)
Borgatti, S.P.: Identifying sets of key players in a network. Computational, Mathematical and Organizational Theory 12(1), 21–34 (2006)
Tutzauer, F.: Entropy as a measure of centrality in networks characterized by path-transfer flow. Social Networks 29(2), 249–265 (2006)
Shetty, J., Adibi, J.: Discovering important nodes through graph entropy the case of enron email database. In: LinkKDD 2005: Proceedings of the 3rd international workshop on Link discovery, pp. 74–81. ACM, New York (2005)
Doyle, P.G., Snell, L.T.: Random Walks and Electric Networks. Mathematical Association of America (1984)
Kamada, T., Kawai, S.: An algorithm for drawing general undirected graphs. Information Processing Letters 31, 7–15 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ortiz-Arroyo, D., Hussain, D.M.A. (2008). An Information Theory Approach to Identify Sets of Key Players. In: Ortiz-Arroyo, D., Larsen, H.L., Zeng, D.D., Hicks, D., Wagner, G. (eds) Intelligence and Security Informatics. EuroIsI 2008. Lecture Notes in Computer Science, vol 5376. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89900-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-89900-6_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89899-3
Online ISBN: 978-3-540-89900-6
eBook Packages: Computer ScienceComputer Science (R0)