Practical algorithms for destabilizing terrorist networks

  • Authors:
  • Nasrullah Memon;Henrik Legind Larsen

  • Affiliations:
  • Software Intelligence Security Research Center, Department of Software and Media Technology, Aalborg University, Esbjerg, Denmark;Software Intelligence Security Research Center, Department of Software and Media Technology, Aalborg University, Esbjerg, Denmark

  • Venue:
  • ISI'06 Proceedings of the 4th IEEE international conference on Intelligence and Security Informatics
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper uses centrality measures from complex networks to discuss how to destabilize terrorist networks. We propose newly introduced algorithms for constructing hierarchy of covert networks, so that investigators can view the structure of terrorist networks / non-hierarchical organizations, in order to destabilize the adversaries. Based upon the degree centrality, eigenvector centrality, and dependence centrality measures, a method is proposed to construct the hierarchical structure of complex networks. It is tested on the September 11, 2001 terrorist network constructed by Valdis Krebs. In addition we also propose two new centrality measures i.e., position role index (which discovers various positions in the network, for example, leaders / gatekeepers and followers) and dependence centrality (which determines who is depending on whom in a network). The dependence centrality has a number of advantages including that this measure can assist law enforcement agencies in capturing / eradicating of node (terrorist) which may disrupt the maximum of the network.