Analyzing illegal psychostimulant trafficking networks using noisy and sparse data

This article applies analytical approaches to map illegal psychostimulant (cocaine and methamphetamine) trafficking networks in the US using purity-adjusted price data from the System to Retrieve Information from Drug Evidence. We use two assumptions to build the network: (i) the purity-adjusted pri...

Full description

Saved in:
Bibliographic Details
Published inIIE transactions Vol. 56; no. 3; pp. 269 - 281
Main Authors Bjarnadottir, Margret V., Chandra, Siddharth, He, Pengfei, Midgette, Greg
Format Journal Article
LanguageEnglish
Published Abingdon Taylor & Francis Ltd 03.03.2024
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:This article applies analytical approaches to map illegal psychostimulant (cocaine and methamphetamine) trafficking networks in the US using purity-adjusted price data from the System to Retrieve Information from Drug Evidence. We use two assumptions to build the network: (i) the purity-adjusted price is lower at the origin than at the destination and (ii) price perturbations are transmitted from origin to destination. We then adopt a two-step analytical approach: we formulate the data aggregation problem as an optimization problem, then construct an inferred network of connected states and examine its properties.We find, first, that the inferred cocaine network created from the optimally aggregated dataset explains 46% of the anecdotal evidence, compared with 28.4% for an over-aggregated and 14.5% for an under-aggregated dataset. Second, our network reveals a number of phenomena, some aligning with what is known and some previously unobserved. To demonstrate the applicability of our method, we compare our cocaine data analysis results with parallel analysis of methamphetamine data. These results likewise align with prior knowledge, but also present new insights. Our findings show that an optimally aggregated dataset can provide a more accurate picture of an illicit drug network than can suboptimally aggregated data.
ISSN:2472-5854
2472-5862
DOI:10.1080/24725854.2023.2254357