Abstract
The key player problem (KPP) identifies a set of key nodes that have a central role in a network. In this paper, we propose a generalized KPP (GKPP) that extends existing work on KPP-Pos and KPP-Neg in such a way that it can consider network structure, node attributes, and the characteristics of edges. We also articulate a novel concept called the key player problem for exclusion (KPP-E), which selects a set of nodes to enforce the centrality of a given set of nodes of interest. To solve this problem efficiently, we propose a sequential greedy algorithm that significantly reduces computational complexity. To corroborate the conceptual meaning and effectiveness of the proposed sequential greedy algorithm, we apply GKPP and KPP-E to several real and random networks.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Arroyo DO, Hussain DMA (2008) An information theory approach to identify sets of key players, intelligence and security informatics. Lecture notes in computer science, vol. 5376, pp 15–26
Ashworth MJ (2003) Identifying key contributors to performance in organizations: the case for knowledge-based measures. In: Proceedings of the first annual conference of the North American association for computational social and organizational science, 22–25 June, 2003, Pittsburgh, PA, USA
Ballester C, Calvo-Armengol A, Zenou Y (2006) Who’s who in networks. Wanted: the key player. Econometrica 74(5):1403–1417
Bonacich P, Lloyd P (2001) Eigenvector-like measures of centrality for asymmetric relations. Soc Netw 23:191–201
Bonacich P, Holdren AC, Johnston M (2004) Hyper-edges and multidimensional centrality. Soc Netw 26:189–203
Borgatti, SP (2003) The Key Player Problem. In Breiger R, Carley K, Pattison P (eds.) Dynamic Social Network Modeling and Analysis: Workshop Summary and Papers. National Academy of Sciences Press, pp. 241–252
Borgatti SP (2005) Centrality and network flow. Soc Netw 27:55–71
Borgatti SP (2006) Identifying sets of key players in a social network. J Comput Math Organ Theory 12:21–34
Canright G, Monsen KE (2006) Spreading on networks: a topographic view. Complexus 3:131–146
Carreras I, Miorandi D, Canright GS, Monsen KE (2007) Eigenvector centrality in highly partitioned mobile networks: principles and applications. In: Advances in biologically inspired information systems, vol. 69, pp 125–147
Davidsen SA (2009) Sampling/misinformation effect on centrality measures in complex networks. http://www.atmakuridavidsen.com/soren/pubs/cis3-report-final.pdf. Accessed 2009
Freeman LC (1979) Centrality in networks: conceptual clarification. Soc Netw 1:215–239
Hamill JT (2006) Analysis of layered social networks. Dissertation, Air Force Institute of Technology
Hussain DMA (2010) Investigation of key-player problem in terrorist networks using Bayes conditional probability. In: Handbook of social network technologies and applications Part 4, pp 523–547
Kolaczyk ED, Chua D, Barthelemy BM (2007) Co-betweenness: a pairwise notion of centrality. CoRR abs/0709.3420
Krebs V (2002) Uncloaking terrorist network. First Monday 7(4):223
Manyika J, Chui M, Brown B, Bughin J, Dobbs R, Roxburgh C, Bayers AH (2011) Big data: the next frontier for innovation, competition, and productivity. McKinsey Global Institute, New York
Marianov V, Serra D (2011) Median problems in networks. Foundations of location analysis. Springer, New York, pp 39–60
McGuire RM (2011) Weighted key player problem for social network analysis. Dissertation, Air Force Institute of Technology
Moreno JL (1953) Who shall survive? A new approach to the problem of human interrelations. Beacon House Inc., Beacon
Renfro RS (2001) Modeling and analysis of social networks. Dissertation, Air Force Institute of Technology
Shannon CE (1948) A mathematical theory of communication. Bell Syst Tech J 27:379–423
Stephenson K, Zelen M (1989) Rethinking centrality: methods and examples. Soc Netw 11:1–37
Tsvetovat M (2005) Social structure simulation and inference using artificial intelligence techniques. Dissertation, Carnegie Mellon University
Tutzauer F (2007) Entropy as a measure of centrality in networks characterized by path-transfer flow. Soc Netw 29:249–265
Wikipedia (2013) http://en.wikipedia.org/wiki/World’s_busiest_airports_by_passenger_traffic
Wu A, Garland YM, Ham J (2004) Mining scale-free networks using geodesic clustering. In: Proceedings of the tenth ACM SIGKDD international conference on knowledge discovery and data mining, 22–25 Aug, 2004, Seattle, WA, USA
Wu G, Talwar S, Johnsson K, Himayat N, Johnson KD (2011) M2M: from mobile to embedded internet. IEEE Commun Mag 49:36–43
Acknowledgments
The author would like to thank the anonymous reviewers for their valuable comments to improve the quality of the paper significantly.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Yang, J. Generalized key player problem. Comput Math Organ Theory 21, 24–47 (2015). https://doi.org/10.1007/s10588-014-9175-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10588-014-9175-4