Network Disruption via Continuous Batch Removal: The Case of Sicilian Mafia
Authors:
- Mingshan JiaMJMingshan Jia
- Pasquale De MeoPMPasquale De Meo
- Bogdan GabrysBGBogdan Gabrys
- Katarzyna MusialKMKatarzyna Musial
Preprint
Abstract
Network disruption is pivotal in understanding the robustness and vulnerability of complex networks, which is instrumental in devising strategies for infrastructure protection, epidemic control, cybersecurity, and combating crime. In this paper, with a particular focus on disrupting criminal networks, we proposed to impose a within-the-largest-connected-component constraint in a continuous batch removal disruption process. Through a series of experiments on a recently released Sicilian Mafia network, we revealed that the constraint would enhance degree-based methods while weakening betweenness-based approaches. Moreover, based on the findings from the experiments using various disruption strategies, we propose a structurally-filtered greedy disruption strategy that integrates the effectiveness of greedy-like methods with the efficiency of structural-metric-based approaches. The proposed strategy significantly outperforms the longstanding state-of-the-art method of betweenness centrality while maintaining the same time complexity.Keywords
All Related Versions
This publication has 32 references indexed in Scilit:
- A virtuous combination of structural and skill analysis to defeat organized crimeSocio-Economic Planning Sciences, 2019
- Illicit Network Dynamics: The Formation and Evolution of a Drug Trafficking NetworkJournal of Quantitative Criminology, 2018
- Fast ranking influential nodes in complex networks using a k-shell iteration factorPhysica A: Statistical Mechanics and its Applications, 2016
- Influence maximization in complex networks through optimal percolationNature, 2015
- The territorial expansion of mafia-type organized crime. The case of the Italian mafia in GermanyCrime, Law and Social Change, 2013
- Inside Criminal Networks2009
- On variants of shortest-path betweenness centrality and their generic computationSocial Networks, 2008
- The efficiency/security trade-off in criminal networksSocial Networks, 2007
- Parameterized graph separation problemsTheoretical Computer Science, 2006
- On the k-cut problemOperations Research Letters, 2000