Analysing covert social network foundation behind terrorism disaster

Abstract

This paper addresses a method to analyze the covert social network foundation hidden behind the terrorism disaster. It is to solve a node discovery problem, which means to discover a node, which functions relevantly in a social network, but escaped from monitoring on the presence and mutual relationship of nodes. The method aims at integrating the expert investigator's prior understanding, insight on the terrorists' social network nature derived from the complex graph theory, and computational data processing. The social network responsible for the 9/11 attack in 2001 is used to execute simulation experiment to evaluate the performance of the method.

Analyzing and modeling real-world phenomena with complex networks: a survey of applications

“…The importance of nodes in terrorism networks was also investigated by Muhammad and Hussain [349]. An interesting finding was reported by Maeno and Ohsawa [350,351], where they proposed a method to solve the node discovery problem in complex networks. Although some previous knowledge is required, this method can be applied in terrorism networks to identify an unobserved agent behind the perpetrators of terrorist attacks.…”

A comparative study of social networking approaches in identifying the covert nodes

“…Yoshiharu Maeno and Yukio Ohsawa [10] uses the clustering and ranking procedure along with the expert investigator's earlier understanding to evaluate the activeness of communication and calculates possibility of the suspicious inter-cluster relationships due to covert nodes between the clusters. It generates a latent structure if the above process is done iteratively.…”

Node discovery in a networked organization

“…The method is applied to analyze the covert social network foundation behind the terrorism disasters [14].…”

“…(14). Suspiciousness means the likeliness where the covert node would appear in the data if it became overt.…”