IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0236476.html
   My bibliography  Save this article

Disrupting resilient criminal networks through data analysis: The case of Sicilian Mafia

Author

Listed:
  • Lucia Cavallaro
  • Annamaria Ficara
  • Pasquale De Meo
  • Giacomo Fiumara
  • Salvatore Catanese
  • Ovidiu Bagdasar
  • Wei Song
  • Antonio Liotta

Abstract

Compared to other types of social networks, criminal networks present particularly hard challenges, due to their strong resilience to disruption, which poses severe hurdles to Law-Enforcement Agencies (LEAs). Herein, we borrow methods and tools from Social Network Analysis (SNA) to (i) unveil the structure and organization of Sicilian Mafia gangs, based on two real-world datasets, and (ii) gain insights as to how to efficiently reduce the Largest Connected Component (LCC) of two networks derived from them. Mafia networks have peculiar features in terms of the links distribution and strength, which makes them very different from other social networks, and extremely robust to exogenous perturbations. Analysts also face difficulties 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 extracted 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 analysis simulated different intervention procedures: (i) arresting one criminal at a time (sequential node removal); and (ii) police raids (node block removal). In both the sequential, and the node block removal intervention procedures, the Betweenness centrality was the most effective strategy in prioritizing the nodes to be removed. For instance, when targeting the top 5% nodes with the largest Betweenness centrality, our simulations suggest a reduction of up to 70% in the size of the LCC. 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 perturbing the operations of criminal and terrorist networks.

Suggested Citation

  • Lucia Cavallaro & Annamaria Ficara & Pasquale De Meo & Giacomo Fiumara & Salvatore Catanese & Ovidiu Bagdasar & Wei Song & Antonio Liotta, 2020. "Disrupting resilient criminal networks through data analysis: The case of Sicilian Mafia," PLOS ONE, Public Library of Science, vol. 15(8), pages 1-22, August.
  • Handle: RePEc:plo:pone00:0236476
    DOI: 10.1371/journal.pone.0236476
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0236476
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0236476&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0236476?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Mastrobuoni Giovanni & Patacchini Eleonora, 2012. "Organized Crime Networks: an Application of Network Analysis Techniques to the American Mafia," Review of Network Economics, De Gruyter, vol. 11(3), pages 1-43, September.
    2. David Bright & Catherine Greenhill & Thomas Britz & Alison Ritter & Carlo Morselli, 2017. "Criminal network vulnerabilities and adaptations," Global Crime, Taylor & Francis Journals, vol. 18(4), pages 424-441, October.
    3. Villani, Salvatore & Mosca, Michele & Castiello, Mauro, 2019. "A virtuous combination of structural and skill analysis to defeat organized crime," Socio-Economic Planning Sciences, Elsevier, vol. 65(C), pages 51-65.
    4. Martin Bouchard, 2007. "On the Resilience of Illegal Drug Markets," Global Crime, Taylor & Francis Journals, vol. 8(4), pages 325-344, November.
    5. Flaviano Morone & Hernán A. Makse, 2015. "Influence maximization in complex networks through optimal percolation," Nature, Nature, vol. 524(7563), pages 65-68, August.
    6. Leo Katz, 1953. "A new status index derived from sociometric analysis," Psychometrika, Springer;The Psychometric Society, vol. 18(1), pages 39-43, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Annamaria Ficara & Francesco Curreri & Giacomo Fiumara & Pasquale De Meo & Antonio Liotta, 2022. "Covert Network Construction, Disruption, and Resilience: A Survey," Mathematics, MDPI, vol. 10(16), pages 1-43, August.
    2. Manzi, Deborah & Calderoni, Francesco, 2024. "The resilience of drug trafficking organizations: Simulating the impact of police arresting key roles," Journal of Criminal Justice, Elsevier, vol. 91(C).
    3. Niles Breuer & Federico Varese, 2023. "The Structure of Trade-type and Governance-type Organized Crime Groups: A Network Study," The British Journal of Criminology, Centre for Crime and Justice Studies, vol. 63(4), pages 867-888.
    4. Juanjuan Luo & Teng Fei & Meng Tian & Yifei Liu & Meng Bian, 2023. "Sensitivity metrics of complex network based on co-occurrence truth table: exemplified by a high-speed rail network," Journal of Geographical Systems, Springer, vol. 25(4), pages 519-538, October.
    5. Annamaria Ficara & Giacomo Fiumara & Salvatore Catanese & Pasquale De Meo & Xiaoyang Liu, 2022. "The Whole Is Greater than the Sum of the Parts: A Multilayer Approach on Criminal Networks," Future Internet, MDPI, vol. 14(5), pages 1-21, April.
    6. Liu, Qian & Wang, Jian & Zhao, Zhidan & Zhao, Na, 2022. "Relatively important nodes mining algorithm based on community detection and biased random walk with restart," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 607(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Annamaria Ficara & Francesco Curreri & Giacomo Fiumara & Pasquale De Meo & Antonio Liotta, 2022. "Covert Network Construction, Disruption, and Resilience: A Survey," Mathematics, MDPI, vol. 10(16), pages 1-43, August.
    2. Manzi, Deborah & Calderoni, Francesco, 2024. "The resilience of drug trafficking organizations: Simulating the impact of police arresting key roles," Journal of Criminal Justice, Elsevier, vol. 91(C).
    3. Wu, Tao & Xian, Xingping & Zhong, Linfeng & Xiong, Xi & Stanley, H. Eugene, 2018. "Power iteration ranking via hybrid diffusion for vital nodes identification," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 506(C), pages 802-815.
    4. Smith, Thomas Bryan, 2021. "Gang crackdowns and offender centrality in a countywide co-offending network: A networked evaluation of Operation Triple Beam," Journal of Criminal Justice, Elsevier, vol. 73(C).
    5. Hahn, Youjin & Islam, Asadul & Patacchini, Eleonora & Zenou, Yves, 2015. "Network Structure and Education Outcomes: Evidence from a Field Experiment in Bangladesh," IZA Discussion Papers 8872, Institute of Labor Economics (IZA).
    6. Lindquist, Matthew J. & Zenou, Yves, 2019. "Crime and Networks: 10 Policy Lessons," IZA Discussion Papers 12534, Institute of Labor Economics (IZA).
    7. Wandelt, Sebastian & Sun, Xiaoqian & Zhang, Anming, 2023. "Towards analyzing the robustness of the Integrated Global Transportation Network Abstraction (IGTNA)," Transportation Research Part A: Policy and Practice, Elsevier, vol. 178(C).
    8. Wang, Zhixiao & Zhao, Ya & Xi, Jingke & Du, Changjiang, 2016. "Fast ranking influential nodes in complex networks using a k-shell iteration factor," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 461(C), pages 171-181.
    9. Xie, Zheng & Lv, Yiqin & Song, Yiping & Wang, Qi, 2024. "Data labeling through the centralities of co-reference networks improves the classification accuracy of scientific papers," Journal of Informetrics, Elsevier, vol. 18(2).
    10. Li Zeng & Changjun Fan & Chao Chen, 2023. "Leveraging Minimum Nodes for Optimum Key Player Identification in Complex Networks: A Deep Reinforcement Learning Strategy with Structured Reward Shaping," Mathematics, MDPI, vol. 11(17), pages 1-13, August.
    11. Zenou, Yves & Patacchini, Eleonora & Islam, Asad, 2015. "Teams, Organization and Education Outcomes: Evidence from a field experiment in Bangladesh," CEPR Discussion Papers 10631, C.E.P.R. Discussion Papers.
    12. Zenou, Yves & Lindquist, Matthew, 2014. "Key Players in Co-Offending Networks," CEPR Discussion Papers 9889, C.E.P.R. Discussion Papers.
    13. Wang, Dong & Small, Michael & Zhao, Yi, 2021. "Exploring the optimal network topology for spreading dynamics," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 564(C).
    14. Zhai, Li & Yan, Xiangbin & Zhang, Guojing, 2018. "Bi-directional h-index: A new measure of node centrality in weighted and directed networks," Journal of Informetrics, Elsevier, vol. 12(1), pages 299-314.
    15. Annamaria Ficara & Giacomo Fiumara & Salvatore Catanese & Pasquale De Meo & Xiaoyang Liu, 2022. "The Whole Is Greater than the Sum of the Parts: A Multilayer Approach on Criminal Networks," Future Internet, MDPI, vol. 14(5), pages 1-21, April.
    16. Meisam Akbarzadeh & Soroush Memarmontazerin & Sybil Derrible & Sayed Farzin Salehi Reihani, 2019. "The role of travel demand and network centrality on the connectivity and resilience of an urban street system," Transportation, Springer, vol. 46(4), pages 1127-1141, August.
    17. Nicola Giuseppe Castellano & Roy Cerqueti & Bruno Maria Franceschetti, 2021. "Evaluating risks-based communities of Mafia companies: a complex networks perspective," Review of Quantitative Finance and Accounting, Springer, vol. 57(4), pages 1463-1486, November.
    18. Thomas J. Sargent & John Stachurski, 2022. "Economic Networks: Theory and Computation," Papers 2203.11972, arXiv.org, revised Jul 2022.
    19. Karimi, Fatemeh & Lotfi, Shahriar & Izadkhah, Habib, 2021. "Community-guided link prediction in multiplex networks," Journal of Informetrics, Elsevier, vol. 15(4).
    20. D’Errico, Marco & Battiston, Stefano & Peltonen, Tuomas & Scheicher, Martin, 2018. "How does risk flow in the credit default swap market?," Journal of Financial Stability, Elsevier, vol. 35(C), pages 53-74.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0236476. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.