Disrupting Resilient Criminal Networks through Data Analysis: The case of Sicilian Mafia

• URL: http://arxiv.org/abs/2003.05303v1
• Date: Tue, 10 Mar 2020 12:42:59 GMT
• Title: Disrupting Resilient Criminal Networks through Data Analysis: The case of Sicilian Mafia
• Authors: Lucia Cavallaro, Annamaria Ficara, Pasquale De Meo, Giacomo Fiumara, Salvatore Catanese, Ovidiu Bagdasar and Antonio Liotta
• Abstract summary: We unveil the structure of Sicilian Mafia gangs, based on two real-world datasets. We gain insights as to how to efficiently disrupt them. Our work has significant practical applications for tackling criminal and terrorist networks.
• Score: 3.863757719887419
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Compared to other types of social networks, criminal networks present hard challenges, due to their strong resilience to disruption, which poses severe hurdles to law-enforcement agencies. Herein, we borrow methods and tools from Social Network Analysis to (i) unveil the structure of Sicilian Mafia gangs, based on two real-world datasets, and (ii) gain insights as to how to efficiently disrupt them. Mafia networks have peculiar features, due to the links distribution and strength, which makes them very different from other social networks, and extremely robust to exogenous perturbations. Analysts are also faced with the difficulty in collecting reliable datasets that accurately describe the gangs' internal structure and their relationships with the external world, which is why earlier studies are largely qualitative, elusive and incomplete. An added value of our work is the generation of two real-world datasets, based on raw data derived from juridical acts, relating to a Mafia organization that operated in Sicily during the first decade of 2000s. We created two different networks, capturing phone calls and physical meetings, respectively. Our network disruption analysis simulated different intervention procedures: (i) arresting one criminal at a time (sequential node removal); and (ii) police raids (node block removal). We measured the effectiveness of each approach through a number of network centrality metrics. We found Betweeness Centrality to be the most effective metric, showing how, by neutralizing only the 5% of the affiliates, network connectivity dropped by 70%. We also identified that, due the peculiar type of interactions in criminal networks (namely, the distribution of the interactions frequency) no significant differences exist between weighted and unweighted network analysis. Our work has significant practical applications for tackling criminal and terrorist networks.

Related papers

• Network Fault-tolerant and Byzantine-resilient Social Learning via Collaborative Hierarchical Non-Bayesian Learning [2.236663830879273]
  We address the problem of non-Bayesian learning over networks vulnerable to communication failures and adversarial attacks. We first propose a hierarchical robust push-sum algorithm that can achieve average consensus despite frequent packet-dropping link failures. We then obtain a packet-dropping fault-tolerant non-Bayesian learning algorithm with provable convergence guarantees.
  arXiv  Detail & Related papers  (2023-07-27T15:46:46Z)
• Enabling Inter-organizational Analytics in Business Networks Through Meta Machine Learning [0.0]
  Fear of disclosing sensitive information as well as the sheer volume of the data that would need to be exchanged are key inhibitors for the creation of effective system-wide solutions. We propose a meta machine learning method that deals with these obstacles to enable comprehensive analyses within a business network.
  arXiv  Detail & Related papers  (2023-03-28T09:06:28Z)
• Stereoscopic Universal Perturbations across Different Architectures and Datasets [60.021985610201156]
  We study the effect of adversarial perturbations of images on deep stereo matching networks for the disparity estimation task. We present a method to craft a single set of perturbations that, when added to any stereo image pair in a dataset, can fool a stereo network. Our perturbations can increase D1-error (akin to fooling rate) of state-of-the-art stereo networks from 1% to as much as 87%.
  arXiv  Detail & Related papers  (2021-12-12T02:11:31Z)
• Relational Graph Neural Networks for Fraud Detection in a Super-App environment [53.561797148529664]
  We propose a framework of relational graph convolutional networks methods for fraudulent behaviour prevention in the financial services of a Super-App. We use an interpretability algorithm for graph neural networks to determine the most important relations to the classification task of the users. Our results show that there is an added value when considering models that take advantage of the alternative data of the Super-App and the interactions found in their high connectivity.
  arXiv  Detail & Related papers  (2021-07-29T00:02:06Z)
• Measuring the impact of spammers on e-mail and Twitter networks [0.0]
  This paper investigates if senders of large amounts of irrelevant or unsolicited information - commonly called "spammers" - distort the network structure of social networks. Two large social networks are analyzed, the first extracted from the Twitter discourse about a big telecommunication company, and the second obtained from three years of email communication of 200 managers working for a large multinational company. Results show that spammers do not significantly alter the structure of the information-carrying network, for most of the social indicators.
  arXiv  Detail & Related papers  (2021-05-21T10:13:11Z)
• Robustness and stability of enterprise intranet social networks: The impact of moderators [0.0]
  We analyzed more than 52,000 messages posted by approximately 12,000 employees. We removed the forum moderators, the spammers, the overly connected nodes and the nodes lying at the network periphery. Our findings can help online community managers to understand the role of moderators within intranet forums.
  arXiv  Detail & Related papers  (2021-05-19T13:43:03Z)
• Criminal Networks Analysis in Missing Data scenarios through Graph Distances [5.164732466825455]
  In this paper we analyse nine real criminal networks of different nature. We quantify the impact of incomplete data and to determine which network type is most affected by it.
  arXiv  Detail & Related papers  (2021-02-28T11:12:05Z)
• Robustness Threats of Differential Privacy [70.818129585404]
  We experimentally demonstrate that networks, trained with differential privacy, in some settings might be even more vulnerable in comparison to non-private versions. We study how the main ingredients of differentially private neural networks training, such as gradient clipping and noise addition, affect the robustness of the model.
  arXiv  Detail & Related papers  (2020-12-14T18:59:24Z)
• Measurement-driven Security Analysis of Imperceptible Impersonation Attacks [54.727945432381716]
  We study the exploitability of Deep Neural Network-based Face Recognition systems. We show that factors such as skin color, gender, and age, impact the ability to carry out an attack on a specific target victim. We also study the feasibility of constructing universal attacks that are robust to different poses or views of the attacker's face.
  arXiv  Detail & Related papers  (2020-08-26T19:27:27Z)
• Bridging Mode Connectivity in Loss Landscapes and Adversarial Robustness [97.67477497115163]
  We use mode connectivity to study the adversarial robustness of deep neural networks. Our experiments cover various types of adversarial attacks applied to different network architectures and datasets. Our results suggest that mode connectivity offers a holistic tool and practical means for evaluating and improving adversarial robustness.
  arXiv  Detail & Related papers  (2020-04-30T19:12:50Z)
• Firearm Detection and Segmentation Using an Ensemble of Semantic Neural Networks [62.997667081978825]
  We present a weapon detection system based on an ensemble of semantic Convolutional Neural Networks. A set of simpler neural networks dedicated to specific tasks requires less computational resources and can be trained in parallel. The overall output of the system given by the aggregation of the outputs of individual networks can be tuned by a user to trade-off false positives and false negatives.
  arXiv  Detail & Related papers  (2020-02-11T13:58:16Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.