Abstract
In Social Network Analysis (SNA) it is quite conventional to employ graph theory concepts for example cut-points and cut-sets or measuring node centralities like betweenness, degree and closeness to highlight important actors in the network. However, it is also believed that most of these measures alone are inadequate for investigating terrorist/covert networks. In this paper we compute posterior probability using Bayes conditional probability theorem to compute each nodes positional probability to see how probable/likely that the node is a key player. Obviously, larger the probability value higher is the chances that the node is a key actor, the system after words using the computed probability can select an arbitrary number of nodes for elimination to make the network non-functional or severely destroying its capability. We know that that network fragmentation in its simplest form is a count of the number of components, more the number of counts larger is the fragmentation. The reason of calling it simple is because it does not include many aspects of the network for example structure etc. Borgatti has provided a similar measure which does includes the shape and internal structure of the components and high light the important actors in the network. Our computational procedure provides very similar results in highlighting the key player problem. We simulated our computational model through various random networks and we also applied it to the David Krackhardt’s kite network and to 9-11 hijackers network to bench mark our results. It shows that conceptually this framework of evaluation can be used to highlight the key players in terrorist/covert cells.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Borgatti S. P:. Identifying sets of key players in a network. Computational, Mathematical and Organizational Theory 12(1), pages 21–34, 2006.
Borgatti S. P:. The key player problem. In R. Breiger, K. Carley, and P. Pattison, (eds.), Dynamic social network modeling and analysis, workshop summary and papers. National Academy of Sciences Press, pages 241–252, 2003.
Borgatti S. P. and M. G. Everett:. The centrality of groups and classes. Journal of Mathematical Sociology 23(3), pages 181–201, 1999.
Valdis Krebs:. Connecting the dots, tracking two identified terrorists, 2002.
Bavelas A:. A mathematical model for group structures. Human Organization 7, pages 16–30, 1948.
Shaw M. E:. Group structure and the behaviour of individuals in small groups. Journal of Psychology 38, pages 139–149, 1954.
Bavelas A:. Communication patterns in task oriented groups. Journal of the Acoustical Society of America 22, pages 271–282, 1950.
Leavitt Harold J:. Some effects of communication patterns on group performance. Journal of Abnormal and Social Psychology 46, pages 38–50, 1951.
Smith Sidney L:. Communication pattern and the adaptability of task-oriented groups: an experimental study. Cambridge, MA, Group networks laboratory, research laboratory of electronics, Massachusetts Institute of Technology, 1950.
Bavelas A. and D. Barrett:. An expermental approach to organizational communication. Personnel 27, pages 366–371, 1951.
Glanzer M. and R. Glaser:. Techniques for the study of team structure and behaviour. Part II: Empirical studies of the effects of structure. Technical report, Pittsburgh, American Institute, 1957.
Glanzer M. and R. Glaser:. Techniques for the study of group structure and behaviour. Part II: Empirical studies of the effects of structure in small groups. Psychological Bulletin 58, pages l–27, 1961.
Cohen A. M:. Communication networks in research and training. Personnel Administration 27, pages 18–24, 1964.
Shaw M. E:. Communication networks. In L. Berkowitz (ed.), Advances in experimental social psychology, vol. vi, pages 111–147, New York, Academic Press, 1964.
Stephenson K. A. and M. Zelen:. Rethinking centrality: methods and examples. Social Networks 11, pages 1–37, 1989.
Flament C:. Applications of graph theory to group structure. Englewood Cliffs, NJ, Prentice Hall, 1963.
Burgess R. L:. Communication networks and behavioural consequences. Human Relations 22, pages 137–l59, 1968.
Snadowski A:. Communication network research: an examination of controversies. Human Relations 25, pages 283–306, 1972.
Rogers D. L:. Socio-metric analysis of inter-organizational relations: application of theory and measurement. Rural Socioeonv 39, pages 487–503, 1974.
Rogers D. L:. Communication networks in organizations. Communication in organizations, pages 108–148, New York, Free Press, 1976.
Cohn B. S. and M. Marriott:. Networks and centres of integration in indian civilization. Journal of Social Research I, pages 1–9, 1958.
Pitts F. R:. A graph theoretic approach to historical geography. The Professional Geographer 17, pages 15–20, 1965.
Latora V. and M. Marchiori:. A measure of centrality based on network efficiency, arxiv.org preprint cond-mat/0402050, 2004.
Freeman Linton C:. A set of measures of centrality based on betweenness. Sociometry 40, pages 35–41, 1971.
Freeman Linton C:. Centrality in social networks: conceptual clarification. Social Networks 1, page 215–239, 1979.
Anthonisse J. M:. The rush in a graph, University of Amsterdam Mathematical Centre, Amsterdam, 1971.
Nieminen J:. On centrality in a graph. Scandinavian Journal of Psychology 15, pages 322–336, 1974.
Scott J:. Social networks analysis, 2nd edition, London, Sage Publications, 2003.
Sabidussi G:. The centrality index of a graph. Psychometrika 31, pages 581–603, 1966.
Shaw M. J., C. Subramaniam, G. W. Tan and M. E. Welge:. Knowledge management and data mining for marketing. Decision Support Systems 31(1), pages 127–137, 2001.
Carley K. M., J.-S. Lee and D. Krackhardt:. Destabilizing networks, Dept. of Social and Decision Sciences, Carnegie Mellon University, Pittsburgh, PA 15143, November 2001.
Akbar Hussain D. M:. Destabilization of terrorist networks through argument driven hypothesis model. Journal of Software 2(6), pages 22–29, 2007.
Akbar Hussain D. M. and D. Ortiz-Arroy:. Locating key actors in social networks using bayes posterior probability framework, lecture notes in computer science. In Intelligence and Security Informatics, vol. 5376/2008.
Ortiz-Arroy D. and D. M. Akbar Hussain:. An information theory approach to identify sets of key players. In Intelligence and Security Informatics, vol. 5376/2008.
Adibi J. and J. Shetty:. Discovering important nodes through graph entropy the case of enron email database. In Linkkdd 2005: Proceedings of the 3rd international workshop on link discovery, pages 74–81, ACM, New York, 2005.
Freeman L. C., S. P. Borgatti and D. R. White:. Centrality in valued graphs, a measure of betweenness based on network flow. Social Networks 13, pages 141–154, 1991.
Newman M. E. J:. A measure of betweenness centrality based on random walks, cond-mat/0309045, 2003.
Beauchamp M. A:. An improved index of centrality. Behavioral Science 10, pages 161–163, 1965.
Oliver C. Ibe:. Fundamentals of applied probability and random processes, Elsevier Academics Press, ISBN 0-12-088508-5, 2005.
Montgomery D. C. and G. C. Runger:. Applied statistics abd probability for engineers, 4th edition, ISBN 978-0-471-74589-1, Wiley, 2006.
Koskinen J. H. and T. A. B. Snijders:. Bayesian inference for dynamic social network data. Journal of Statistical Planning and Inference 137, pages 3930–3938, 2007.
Siddarth K., H. Daning and C. Hsinchum:. Dynamic social network analysis of a dark network: identifying significant facilitators. In Proceedings of IEEE international conference on intelligence and security informatics, ISI 2007, New Brunswick, NJ, USA, May 23–24, 2007.
C. J. Rhodes and E. M. J. Keefe:. Social network topology: a bayesian approach. Journal of the Operational Research Society 58, pages 1605–1611, 2007.
Sparrow M.:. The application of netwrok analysis to criminal intelligence: an assessment of the prospects. Social Networks 13, pages 251–274, 1991.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Hussain, D.M.A. (2010). Investigation of Key-Player Problem in Terrorist Networks Using Bayes Conditional Probability. In: Furht, B. (eds) Handbook of Social Network Technologies and Applications. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-7142-5_24
Download citation
DOI: https://doi.org/10.1007/978-1-4419-7142-5_24
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-7141-8
Online ISBN: 978-1-4419-7142-5
eBook Packages: Computer ScienceComputer Science (R0)