Main Article Content

Tomas Angel Sarmiento Bahoque http://orcid.org/0000-0002-6413-7204 John Fredys Cantillo Palacio John Eduardo Realpe Gómez http://orcid.org/0000-0002-5473-2464 Javier Antonio Montoya Martínez http://orcid.org/0000-0003-0507-452X

Abstract

This work deals with the study and comparison of different strategies for the optimal dismantling of delinquent networks, which aim to optimally identify the most relevant individuals in the network. The strategy of greater complexity that we have studied here, is based on the Katz-Bonacich centrality criteria as a measure of influence of the individuals in the network. This results in an NP-hard type of problem, therefore, in order to apply that criteria, we must use heuristic methods which allow us to find approximate solutions. In particular, the methods used in this work are the Monte Carlo and greedy algorithms. We compared their performance against less sophisticated strategies and we were able to find that these algorithms perform relatively better, which contributes to improve our understanding of these approaches. In addition, we discuss a model that was recently introduced, which justifies the use of Katz-Bonacich centrality from the point of view of game theory on networks.

Downloads

Download data is not yet available.

Article Details

Keywords
Complex systems, computational modeling, network models, game theory, delinquent networks, statistical mechanics, ICT
How to Cite
SARMIENTO BAHOQUE, Tomas Angel et al. Optimal dismantling of criminal networks. A perspective from the mathematical and computational modeling. Ingeniería y Ciencia, [S.l.], v. 12, n. 24, p. 83-103, nov. 2016. ISSN 2256-4314. Available at: <http://publicaciones.eafit.edu.co/index.php/ingciencia/article/view/3293>. Date accessed: 16 dec. 2017. doi: https://doi.org/10.17230/ingciencia.12.24.4.
Section
Articles