https://doi.org/10.1140/epjst/e2013-01935-7
Regular Article
The importance of centralities in dark network value chains
1 Lorand Eötvös University, Budapest, Hungary
2 Aitia International, Inc., Budapest, Hungary
3 PetaByte Research Ltd., Budapest, Hungary
4 Research and Analysis, Police Unit the Hague, The Netherlands
5 University of Amsterdam, The Netherlands
6 Research Institute ITMO, St. Petersburg, Russian Federation
7 Complexity Program, Nanyang Technological University, Singapore
8 DFKI (German Research Insitute for Artificial Intelligence), Trippstadter Strasse 122, 67663 Kaiserslautern, Germany
a e-mail: noemi1987@citromail.hu
b e-mail: gulyas@petabyte-research.org
c e-mail: rlegendi@aitia.ai
d e-mail: pacduijn@gmail.com
e e-mail: p.m.a.sloot@uva.nl
f e-mail: gk@hps.elte.hu
Received: 3 June 2013
Revised: 10 July 2013
Published online:
13
September
2013
This paper introduces three novel centrality measures based on the nodes’ role in the operation of a joint task, i.e., their position in a criminal network value chain. For this, we consider networks where nodes have attributes describing their “capabilities” or “colors”, i.e., the possible roles they may play in a value chain. A value chain here is understood as a series of tasks to be performed in a specific order, each requiring a specific capability. The first centrality notion measures how many value chain instances a given node participates in. The other two assess the costs of replacing a node in the value chain in case the given node is no longer available to perform the task. The first of them considers the direct distance (shortest path length) between the node in question and its nearest replacement, while the second evaluates the actual replacement process, assuming that preceding and following nodes in the network should each be able to find and contact the replacement. In this report, we demonstrate the properties of the new centrality measures using a few toy examples and compare them to classic centralities, such as betweenness, closeness and degree centrality. We also apply the new measures to randomly colored empirical networks. We find that the newly introduced centralities differ sufficiently from the classic measures, pointing towards different aspects of the network. Our results also pinpoint the difference between having a replacement node in the network and being able to find one. This is the reason why “introduction distance” often has a noticeable correlation with betweenness. Our studies show that projecting value chains over networks may significantly alter the nodes’ perceived importance. These insights might have important implications for the way law enforcement or intelligence agencies look at the effectiveness of dark network disruption strategies over time.
© EDP Sciences, Springer-Verlag, 2013