Skip to main content

Thank you for visiting You are using a browser version with limited support for CSS. To obtain the best experience, we recommend you use a more up to date browser (or turn off compatibility mode in Internet Explorer). In the meantime, to ensure continued support, we are displaying the site without styles and JavaScript.

Assessing police topological efficiency in a major sting operation on the dark web


The networked nature of criminals using the dark web is poorly understood and infrequently studied, mostly due to a lack of data. Rarer still are studies on the topological effectiveness of police interventions. Between 2014 and 2016, the Brazilian Federal Police raided a child pornography ring acting inside the dark web. With these data, we build a topic-view network and compare network disruption strategies with the real police work. Only 7.4% of the forum users share relevant content, and the topological features of this core differ markedly from other clandestine networks. Approximately 60% of the core users need to be targeted to fully break the network connectivity, while the real effect of the arrests was similar to random failure. Despite this topological robustness, the overall “viewership network” was still well disrupted by the arrests, because only 10 users contributed to almost 1/3 of the total post views and 8 of these were apprehended. Moreover, the users who were arrested provided a total of 60% of the viewed content. These results indicate that for similar online systems, aiming at the users that concentrate the views may lead to more efficient police interventions than focusing on the overall connectivity.


In general, internet content is considered as belonging to either the surface web or the deep web depending on the possibility of regular search engines to index it. The set of web pages that for any reason are not accessible by web crawlers is typically called the deep web (e.g., subscription information, medical records, financial records, government resources). Due to this property, it is very hard to estimate the relative size of both layers, however, it is widely believed that the deep web is much larger than the surface web. In an even deeper layer, there is an underlying web, called the dark web, in which there is a significant effort to keep users and their data anonymous, by requiring specific configuration methods and software1. Precisely because of this feature, the dark web is sometimes used for illegal purposes that range from the black market to fraud services, to child pornography and terrorism. One of the most well-known platforms on the dark web is the Tor network (there are other services such as Freenet and I2P)2, an anonymity network originally developed by DARPA in the mid-1990s and lately made available worldwide3. Due to its high level of anonymity, the Tor network has been used by criminals to run illegal sites and forums, some of which have been seized by law enforcement agencies worldwide4.

From 2014 to 2016, Brazilian Federal Police Agents monitored the activities of individuals forming a pedophile forum on the Tor project during the so-called Operation Darknet5. The investigation lasted for 2 years and resulted in the identification of 182 targets (out of almost 10,000 users), several prison sentences, search warrants and in the rescue of at least 6 children that were being abused6,7. After that stage, the monitored message board was deactivated by a court order and the data were stored in the Federal Police servers for further analyses. Brazilian Federal Agents were then able to build a network consisting of the interaction between users mediated by the viewing of their posts. According to the National Center for Missing and Exploited Children8 and to the Association of Sites Advocating Child Protection’s white paper9, child pornography is one of the fastest-growing businesses online, with an estimated annual revenue of $3 billion USD. Child pornographic content are shared among offenders who redistribute them online, causing lifelong harm to the victims and even further trauma into adulthood. However, virtually nothing is known about the networked structure of these rings that share and view child abuse content. Even less is known about the real impact of police interventions on dark web criminal networks, mostly because of the lack of comprehensive data. These two aspects represent deep gaps in the literature of criminal networks.

The broader field of criminal networks, however, has experienced considerable growth in the last few years10,11,12. For instance, recent research studied an intelligence network gathered by the Brazilian Federal Police, showing it is highly modular and that it can be broken down with the removal of only 2% of its nodes or edges13. Ribeiro et al. have also explored the dynamical structure of political corruption networks in Brazil, showing the co-occurrence network dynamic is strictly related to the general elections14. Spatial and temporal regularities in crime have also been extensively explored in the context of city science and circadian rhythms15. In general, the data used in mathematical and physical modeling of crime derive from a posteriori and open access sources such as court reports, media coverage or criminal statistics. Therefore, obtaining data from official reliable sources is still today one of the key challenges in the field of criminal networks.

In order to fill the gaps discussed above, and to face one of the crucial tasks of the social physics community researching criminal networks, we study here the unique dataset of the Operation Darknet and make the whole anonymized network data available in the Supplementary Information and in the Supplementary Datasets 1 and 2. In this sense, our research sheds light on the behaviour of child-abuse rings on the dark web by showing that only 7.4% of vertices are responsible for posting the illicit media online and an even smaller number, 0.27% of individuals, concentrate half of the post views. Even though this core of criminals is tightly connected and cooperating for resources, which makes the ties hard to break, the police intervention was 60% efficient in reducing the amount of post views, out of 90% possible. Accordingly, removing the individuals that concentrate the views, instead of the most prominent topologically, could lead to a more efficient disruption. Such an approach might lead to better police interventions when tackling similar online scenarios.


The pedophile ring data were acquired directly from the dark web internet forum or message board investigated during Operation Darknet– i.e., an online discussion site where individuals could interact in the form of posted messages and files in conversations known as topics or threads. All user behavior was emergent, since Brazilian Federal Agents were only passively monitoring all relevant activity. When using the forum, users could interact in a variety of ways, however, the most important for us here was the interaction by topic view where a user would demonstrate their interest in another user by viewing one or several of their posts, often multiple times. In this sense, we constructed the cumulative network by aggregating the data over the entire period of observation, since we do not have access to temporal and/or spatial data. The viewing network was built accordingly— if user i views user j’s post, then a directed edge from i → j is created. If user i had viewed multiple topics posted from user j, the edge is weighted by the number of views.


The topic network consists of a fully connected graph with 10,407 nodes and 842,247 directed edges. In directed networks each node has an in-degree kin, an out-degree kout, and a total degree k = kin + kout. Each directed edge points from a source node towards a target node. The total degree variance-to-mean ratio (VMR) is dall = 1,369.12 meaning the network degree distribution is over-dispersed. This behaviour is easily seen by the VMR for in-degree, din = 2,392.34 and out-degree dout = 109.26. In fact, from the total number of nodes, 7.4% of vertices have in-degree different than zero while almost all users have non-null out-degree (10,404), meaning that only 769 individuals are responsible for posting all child pornography content, while the vast majority (82.6%) of users are only viewing the forum’s material. The resulting averages are 〈kin,out〉 = 80.93 (SD = 440.00). However, just taking the users who share content (i.e. with kin > 0), we find an average in-degree of 1095.2 (SD = 1228.4), this is the number of unique viewers per sharer. On average each of these sharers receives 8,208.4 (SD = 25,825.6) views per post. Accordingly, most users view the posts of only a few others, while a smaller fraction of them tend to view the whole forum content.

In directed graphs, a weakly connected component is a subgraph in which any two vertices are connected regardless of the direction of the geodesic paths. On the other hand, strongly connected components are the ones in which the subgraphs are fully connected by directed shortest paths16. In this sense, the studied network is weakly connected by only one single component. However, there is only one strong component comprising more than one vertex, this is of size 766 while all the other vertices are spokes that are only viewing content and not posting any relevant media (in Fig. 1 we show one possible visualization of this component). Therefore, the core of this online forum is precisely this strongly connected component which is responsible for keeping the structure functioning as a whole, while those individuals who are weakly connected don’t play a prominent structural role. Going forward, we will deal with both of these networks independently and refer to them as the “full network” and the “strong component”. For simplicity, we also label as “sharers” the users belonging to the strongly connected component and as “spokes” the ones belonging to the other components of size 1.

Figure 1
figure 1

The strong component visualization with circular layout. The radii of the nodes are proportional to their in-degree, the edge weight is mapped into its darkness and the higher a node’s out-degree the closer its color is to red. (Not every edge is shown for the sake of clarity).

The topological density of a directed network is defined as the relative number of edges as compared to the possible number of connections. The density of a criminal network is usually related to the “brightness” of the system in the sense that a large number of connections among criminals means that if one actor is caught by law enforcement or intelligence agencies it would be possible, at first, to extract critical information about the local network structure and other participants from that arrested criminal17. On the other hand, a darker network means the direct transfer of information within the network is slowed down due to the decreased number of possible paths among criminals. Therefore, the network density informs us about the compromise between security and effective communication. In this sense, we expect clandestine networks, that operate hidden within the social fabric, such as pedophile and other illegal networks, to have very low levels of density. While the full network also has a low density D = 0.008, the strong component is highly dense (D = 0.192) in comparison with other known criminal networks13.This might be due to the fact that users in Tor browser forums tend to feel safe behind the secrecy of the platform and of the avatar they use. It should also be pointed out though, that with an edge representing viewing of a post, the formation of edges is more liberal than in other criminal networks which, in some cases, could require a physical encounter. In particular, the literature is scarce on networks intermediated by post viewing built in a similar fashion to the one presented here. Networks with similar mechanisms might be built using social networks or subscription services.However, at the time of this research data of this type were not available for us. Despite that, we show in Table 1 the number of nodes (N), edges (E), density (D), modularity (Q), best known topological attack (Att), generalized robustness (R) and assortativity (A) for 8 clandestine networks as well as the full and strong component of the network studied here. Even though these networks have different creating mechanisms (from intelligence to co-offending), they all share one very important underlying social feature, i.e., clandestinity.

Table 1 The table shows the following features of 10 covert networks: network size (N), the number of edges (E), the graph density (D), the average network modularity according to Louvain method (Q), the best known topological targeted attack, the network robustness to that attack (R, see Eq. 2) and the degree assortativity (A). BFP2013 is the Brazilian Federal Police criminal intelligence network13.

Another striking feature of real networks is that they tend to show a coarse-grained structure in which groups (also called communities or modules) of densely interconnected nodes are only sparsely linked to the rest of the network18. This behavior is sometimes useful for criminal networks: while the tightly connected community structure makes it easier for information to spread, the rare connection between communities facilitates secrecy of operations13. The existence of community structures is measured by the network modularity Q, which is the difference between the fraction of edges within modules and the expected fraction if the network were random18, with values of Q close to 1 indicating highly modular structures. There are many different methods for extracting the community structures of a network. Here we used the Leiden method19, a recent modification of the Louvain20 method with improved performance (however, we obtain similar results using Louvain or infomap21). The studied strong component does not show hierarchical activities and well defined community structure, with Q ≈ 0.16 (the extraction algorithm identified only 3 modules with 348, 256 and 162 nodes). The average modularity for 100 Erdös-Rényi graphs with the same size and average degree is Q = 0.033, SD = 0.001, and for 100 configuration models is Q = 0.042, SD = 0.001. Typical values of Q for real-world modular networks range from 0.3 to 0.718, which indicates that the network studied here (with Q ≈ 0.16) is not strongly modular. This feature differentiates it from other known criminal networks (see Table 1). The full network yields a similar value (Q ≈ 0.20) with the major cluster identified being the strong component.

Degree Distribution

As mentioned above, the degree distributions are over-dispersed. The in-degree distribution demonstrates this with a small number of vertices’ in-degrees being far above the mean. As the in-degree of a vertex corresponds to the number of different users viewing that node’s post, these are distributors whose content is highly visible. The out-degree distribution is capped by the number of users sharing content, we observe that one vertex views content from 602 of the 769 providers.

The heterogeneity of the degree distribution is a key feature in studying network robustness22,23,24. For instance, networks with random degree distributions fall apart after the failure of a critical number of nodes. On the other hand, networks with heavy-tailed degree distributions are usually very fragile to targeted attacks to central nodes and full fragmentation is attained after a small fraction of vertices is removed from the system16. Most known criminal networks have heavy-tailed degree distributions13. Using maximum likelihood estimators, the following distributions are tested to the full and tail of the distribution: power law, exponential, Weibull, normal (Gaussian), log-normal and Poisson. The Akaike Information Criterion for small sample sizes is used to select the appropriate model from the log-likelihoods25. In each case the complementary cumulative distribution function is displayed as this has less noise, however, the fits are made to the original degree data. The degree distributions for the full network are shown in the upper panels of Fig. 2 with both the tails being well fitted by Weibull distributions (although a log-normal cannot be ruled out for the in-degree distribution). The lower panels of Fig. 2 shows the in-degree and out-degree distributions only for the strong component of the network. The entire distributions are well-fitted by an exponential and normal (Gaussian) respectively (dashed lines). Fitting to just the tail of the distribution, Weibull distributions are preferred again (dotted lines), however, log-normals cannot be ruled out in either case. In each case, we see a small number of users both viewing content and having their content viewed disproportionately compared to the rest.

Figure 2
figure 2

The in and out-degree distributions for the full network and the strong component. Upper panels (A) and (B): the complementary cumulative degree distributions for the full network Pk for the in-degree in panel (A) and the out-degree panel (B). The tail of each are well fitted by Weibull distributions. Lower panels (C) and (D): the degree distribution for the strong component with the in-degree distribution displayed in panel (C), this receives the best support from an exponential distribution (dashed line), however, fitting to the tail a Weibull (dotted) is best supported. In panel (D) the out-degree distribution is shown, the whole distribution (dashed line) is well fitted by a normal distribution (dashed) and the tail, again, by a Weibull (dotted).

Figure 3 shows the weighted degree-distribution for the full network. The full distribution for the weighted in-degree is best fitted by a log-normal and the out-degree by a Weibull once again (not shown). Fitting to just tails, the best support is received from a log-normal distribution in each case (dotted lines). However, each distribution received some support here and therefore cannot be ruled out. Note that here, the weighted in-degree of a vertex represent the number of times all of that user’s posts were viewed. The top ten weighted in-degrees are all over 100,000.

Figure 3
figure 3

The weighted degree (kw) distribution for the full network. The in-degree distribution is shown in panel (A) and the out-degree distribution is displayed in panel (B), both with fitted log-normal distributions.

Rich-club Effect

In networks from a variety of fields, the most prominent individuals tend to connect among themselves more commonly than at random, building a sort of “exclusive” club as a means of keeping control over the networked system26,27,28,29. This tendency, which is called the rich-club effect, is poorly explored in criminal networks mainly because of the lack of comprehensive data. However, this feature is very relevant in criminal networks’ robustness to police intervention since a high rich-club coefficient might result in tightly connected hubs making the network robust to hub removal. The topological rich-club coefficient is defined for directed graphs as the ratio between the number of edges in the network and the possible amount of edges for nodes with total degree greater than k = kin + kout, for every total degree k, that is:

$$\phi (k)=\frac{{E}_{\ge k}}{{N}_{\ge k}({N}_{\ge k}-1)},$$

where Nk is the number of vertices with degree higher than or equal to k, and Ek is the number of edges among these nodes30. To get statistically significant results, ϕ(k) should be rescaled by the average ϕnull(k) expected for a random graph with same degree distribution; we do so by generating 1,000 ensemble of random networks using both link and weight reshuffle31. Therefore, if ρ(k) = ϕ(k)/ϕnull(k) > 1 the network displays a positive rich-club effect. In this sense, the shaded area in Fig. 4 highlights the regions where the rich-club coefficient is statistically significant, with a 95% confidence level. As depicted in Fig. 4, the strong component shows a rich-club coefficient that becomes more prominent as the connectivity increases, reaching a peak at k > 325 and then vanishing for k > 410. This means that in fact there is a high-degree elite of individuals that tend to associate with one another feeding the online forum with pedophilic media posts and reciprocal viewing. In such a scenario, the presence of a significant positive rich-club is usually related to cooperation between individuals in the upper elite to concentrate post views. The opposing case of a statistically significant anti-rich-club is sometimes associated with competition between individuals for the network resources, post views in this case. However, the top k > 26% sharers do not show significant rich-clubs, and one cannot categorically say if there is competition or cooperation taking place for these individuals.

Figure 4
figure 4

The rich-club coefficient ρ for the strong component as a function of the total degree k with the respective 95% confidence intervals. Weight reshuffle is shown in panel (A) and edge reshuffle in panel (B).

The rich-club effect is actually a specific definition from a more generic measure of degree correlations called assortativity or homophily. While the assortativity essentially measures how connected nodes with similar degree are, the rich-club is only concerned with the connectivity of nodes with degree above a certain threshold. The two measures are not in conflict. For instance, a network consisting of only hubs and spokes, with hubs well connected among them, is typically disassortative (spokes connected to hubs) with the presence of a strong rich-club effect (hubs connected among themselves). This is precisely the virus-like topology of the network studied here. In social and business networks, for example, highly popular individuals tend to connect to others with similar popularity to maintain reputation and social status. However, some online networks are known to be disassortative32. In the particular case studied here, it appears that users are not really interested in keeping an online social status or reputation, in a way there is no strong competition among users. Presumably, individuals are mostly interested in filling their need for child pornography regardless of what source it comes from. Such behaviour would be consistent with the disassortative mixing of −0.21 of the strongly connected component and −0.26 of the full network.

Dismantling Approaches and Police Intervention

Law enforcement resources are limited and investigations usually face multiple practical and legal limitations. Therefore, it is crucial to know the minimum set of nodes that if removed would result in the largest breakdown of a criminal network - a problem that, in abstract, is usually known in network science as the minimum dismantling set, a NP-hard problem that has currently no solution for large-scale networks33,34. From the network science point of view, a criminal network is a graph consisting of criminals (vertices) connected by relationships (edges) that might be of many natures (telephone calls, co-offending, intelligence-based, etc)35. In general, law enforcement interventions aim to identify and arrest criminal actors. This procedure has a simple topological interpretation: when a criminal is put in jail, a fraction of his/her relationships is cut12. This course of action is known to be less effective than neutralization strategies such as the total removal of edges (solitary confinement) or the removal of nodes (full resocialization or death)13. However, when online networks are considered, nodes are only avatars of real people and simply arresting a criminal results in the removal of the online user from the network – a typical neutralization strategy.

Most network disruption strategies are divided into two approaches: non-adaptive (or simultaneous) attacks and adaptive (or sequential) attacks. In the non-adaptive approach, the list of targets is computed only once, before the disruption process begins. In the adaptive approach, the list of targets is updated after each deletion by the recalculation of the centrality index used to sort the nodes. Consequently, adaptive attacks demand more processing time, but on the other hand, they usually produce more damage since they account for the changes in the network topology due to the removal of nodes and edges36. Over the years, several heuristic attack strategies have been proposed to break down complex networks with the least number of removed nodes37,38,39,40. However, the network dismantling problem is an open research area and no ultimate attack strategy is known so far. The order parameter G(q) = Nqs/Ns is usually defined to capture the response of a network to node and/or edge removal, where Nqs is the size of the largest strongly connected component after a fraction q of nodes is removed, and Ns is the size of the original network’s largest strongly connected component. It actually measures the relative size of the largest strongly connected component of the network as a function of the fraction of nodes deleted. In this sense, the generalized robustness of a network to a given disruption strategy36 usually considers the relative size of the largest remaining connected component of the network during the attack procedure as:

$$R=\frac{1}{{N}^{s}(1-{G}_{min})}\mathop{\sum }\limits_{q=0}^{{q}_{max}}G(q),$$

where qmax is the point at which the attack ends and Gmin is the value of the relative size of the largest strongly connected component at qmax.

In many real and artificial networks, high-betweenness adaptive (HBA), high-degree adaptive (HDA), collective influence (CI), and module-based (MBA) attacks tend to decrease the largest connected component of complex graphs very efficiently41. The HBA algorithm consists of sorting nodes according to the betweenness centrality, removing the highest-ranked one, recomputing the index and so forth. The HDA procedure simply substitutes the betweenness centrality by the degree (either total, in or out). The collective influence, which is known to be close to the minimum dismantling set as long as the network has local tree-like structure, consists of the same procedure as before but with the collective influence centrality defined for node i as \(C{I}_{\ell }(i)=({k}_{i}-1)\,{\sum }_{j\in \partial B(i,\ell )}({k}_{j}-1)\), where kj is the degree of the nodes in the edge of a ball of radius l around node i, and ki is the degree of node i39. The sum of weights of the adjacent edges of a given node is called the node’s strength s. For HBA the shortest path algorithm can be generalized to take s into account (call it HBwA), and the same goes with HDA (call it HSA). Figure 5 shows the size of the largest strongly connected component (left panel) as a function of the fraction of nodes removed and the size of the largest connected component regardless of strong and weak components (right panel).

Figure 5
figure 5

The figure shows the fragmentation process. In the left panel (A), the inset figure shows the size of the largest strongly connected component as a function of the fraction of nodes removed according to the best topological attack (HBsA - blue curve), the mean and error bars for a 1,000 random attacks (red curve, Rnd), and the real police intervention result (black diamond shape, DN). In this case the network only breaks completely after 60% of removals. The main figure shows a zoom in near the real police intervention which resulted in a 23% decrease of the strongly connected component, while the topological attack resulted in a 37% breakdown (1.6 times more efficient). The right panel (B) shows the same process but now considering the relative size of the largest connected component (regardless of strong and weak components). Note that in this case even the best topological attack (high in-degree adaptive attack, HiDA) in the region that real police intervention took place is as good as random and the network only breaks after almost 80% of disruption.

The full network is fragile to the removal of a small subset (≈7%) of the vertices. However, these are all in the strong component. Despite the in-degree distributions showing a small number of users sharing most of the content, the strong component is very dense. As shown in Fig. 2, the degree distributions for the strong component are well fitted by exponentials and Gaussians. This also indicates that the strongly connected core should be very resilient both to targeted attacks and random failures. In fact, it would take the random removal of all users for the network to be fully disconnected and the removal of almost 60% of individuals according to the best-targeted attack strategy (see Fig. 5).

We now assess the outcome of the police investigation. To do that, we first explain en passant how police targeted criminals during the Operation Darknet. Firstly, investigators defined a qualitative pyramid of priorities according to the seriousness of their conduct under the Brazilian Penal Code: the most sensitive users were the ones that were apparently committing child abuse in real life, followed by heavy content sharers and then by users that only downloaded material. Afterwards, users started having their real life identify uncovered by lifting the secrecy of the Tor browser cloaking mechanism for each of them– details of such are reserved. After that, the traditional criminal investigation took place, and investigators searched for further evidence of the involvement of each individual in related crimes. In fact, each criminal case demonstrated its own idiosyncrasies and investigative challenges. Besides, some caveats obliged investigators to bypass the seriousness pyramid a few times. For instance, even though the police’s aim was to arrest the largest number of criminals, the technical process of identifying real individuals out of the Tor browser was time consuming and dependent on many practical issues such as the level of expertise on cloaking of each user, while due to legal requirements the investigation had a limiting time frame. The aftermath of the investigation was 176 criminals identified in real life and arrested for either sharing or storing child pornography media and 6 for child abuse— out of this total, 170 were sharers (22% of the strong component) and 12 were spokes.

The main panel of Fig. 5(A) is a zoom in the fragmentation curve that shows the topological effect on the strongly connected component of removing precisely those individuals that were arrested by the police, 22% of sharers and a 23% damage to the strong component. This result lies inside the error bars of the random removal strategy and damaged 1.6 times less the core when compared to the best topological attack. The removal of the 12 spokes does not significantly affect the network. Accordingly, these data indicate that the police investigation was highly effective in identifying individuals belonging to the network core, i.e., to the strongly connected component, since 93% of the identified users are sharers, and led to the arrest of a significant amount of criminals, 22% of the strong component. However, the sharers arrested by the police were not as structurally important as the ones identified by the HBsA method (by a factor of 1.6). On the other hand, the network topology is such that even the best topological intervention could only fully atomize the system after a large removal of more than 60% of all sharers. Moreover, if we consider the only the largest connected component, regardless of edge direction, the network is even more robust, only fragmenting after almost 80% of removals, while topological attacks and police interventions are as good as random failures.

Although the topology of the network is hard to break down, we observe from the weighted in-degree distribution that the majority of posts are shared by a small fraction of the users. In Fig. 6 we show the result of removing nodes in order of weighted in-degree (blue circles). Removing the top 100 nodes reduces the post views by 82.6%. The red squares represent the removal of the arrested users. Initially this is highly successful at disrupting the posts with 8 of the top 10 sharers arrested. With 20 arrests 38.5% of a possible 42.8% reduction of posts is achieved. Subsequent targets are less optimally selected, so that the total arrests reduced the posts by 58.1% of a possible 91.9%. In this sense, removing the top 10 vertices according to the number of post views reduces the total number of views by 29.2%. Removing the top 28 vertices reduces this by 50.2%. Therefore half of the post views in the whole network can be attributed to only 28 users posting content.

Figure 6
figure 6

The fraction of post-views removed by targeting users of highest weighted in-degree (blue circles) and the actual arrests (red squares). Initially the arrests are very successful, quickly disrupting 40% of the post-views.


In this research, we have presented (we believe for the first time) a criminal network inter-mediated by topic view in which pedophiles interacted in a dark web forum using Tor browser. The original directed and weighted network consists of 10,407 users, out of which 9,641 are weakly connected to a central core of only 766 strongly connected individuals. The peripheral 9,638 individuals didn’t post any content online, being what we call spokes. On the other hand, the 766 individuals belonging to the strongly connected core were actively sharing and viewing content, being the ones actually responsible for structuring the whole criminal enterprise. The weakly connected users might be composed of individuals that joined the forum out of curiosity or paedophilic inclinations. However, this structure could be seen as a gateway to more serious criminal activity happening in the network core, a hypothesis that should be addressed in future research when dynamic data are available. As we pointed out, the weakly connected periphery of users is composed only of leaves which have no particular structural role, therefore the main focus is on the strongly connected component.

Even though viewing networks are virtually nonexistent in the literature, we were able to compare the child abusers network with other networks that share the common social feature of clandestinity. The core of strongly connected criminals has many stark differences to other known criminal networks. One of these disparities is that the core has no well defined modular structure, while typical criminal networks tend to display highly coarse-grained topologies. This feature has two relevant interpretations. First, this lack of modular structure points to users not having interests in particular topics of the forum. The second interpretation is related to the fact that recent evidence suggests that modularity arises in competitive scenarios as organized crime, financial markets or predator-prey biological systems. However, the core of the network under study here consists of individuals cooperating to meet their pathological needs. Moreover, clandestine networks’ strategies to cloak their activities from law enforcement investigations is usually reflected by low graph densities. Nonetheless, the strong component of this network is highly dense. In fact, users of the dark web, more precisely of the Tor browser, feel safely hidden by avatars and by several levels of anonymity. Therefore, perhaps users tend to act freely on the online forum, without worrying about cloaking their activities or the local network structure. Besides, the anonymity of a fantasy avatar hinders sociological mechanisms such as the search for indirect prestige through appearances, as shown by the network core’s degree disassortativity. Indeed, users connect among themselves by post views if that particular content indulges their taste for child abuse media, regardless of who produced it. However, it should be pointed out that in a viewing network edges are created much more easily than in some other criminal networks, some of which require a physical interaction. This might also contribute to the high value of the density. Even though the network is highly disassortative, there is a peak of the rich-club coefficient which vanishes for highly connected individuals. The lack of rich-club effect for the highest active criminals indicates the network might be robust to degree-based removals. In fact, the strong network only breaks after the removal of ~60% of the users according to HBsA (or even after ~80% according to HDA if link direction is not taken into account). This is again a stark contrast to most criminal networks which seem to be much more fragile to targeted attacks. This robustness feature is directly related to the degree distribution of the network. While organized crime networks often have heavy-tailed degree distributions, this one is much more homogeneous with a light-tail distribution.

The police force was very effective in identifying criminals belonging to the core— out of 182 users arrested in real life, 170 (93%) belonged to the core while only 12 were weakly connected spokes. However, the targeted attack was only as effective as random failures; even the best topological attack could have been only 1.6 times more effective. Accordingly, the best approach seems to be maintaining sting operations until a large amount of the core is disrupted. Another possibility would be to monitor different online forums searching for recidivist users that couldn’t be arrested due to time and/or legal limitations of previous investigations. However, aiming at the users that attract the most views should decrease the amounts of viewing much easier than breaking the whole structure. Despite the network being very robust, we can still significantly disrupt the amount of views. Only 10 users contribute to almost one third of the post views and a further 16 bring this to half. Eight of those top 10 users were arrested in the investigation, i.e., the police had 80% of accuracy in arresting users that significantly attracted the majority of views. Therefore, even while we can’t easily disrupt the entire network in a traditional sense, we can decrease the content provided without using structural network analysis. In this sense, the real investigation resulted in 60% of post views removed with the arrest of 182 users, a highly effective achievement by the police. However, the investigation could have been targeted to a few more users from these top distributors to achieve a higher disruption of ~90%. By removing individuals that concentrate the views, the remaining activity, even though structurally cohesive, would reduce to only a small amount of views, hampering the main activity of the forum and indirectly disrupting the system.

Future research may aim to gather data from other dark web’s forums to help build a multiplex network able to identify deeper patterns of criminal activities that are not usually targeted by police investigations, but that frequently hop between forums (layers) and thence keep the overall child abuse activity working on the dark web. Another possible future research might be getting access to viewing data through cooperation with social network services in order to compare these results to other networks (licit and illicit) with similar building mechanisms.

We hope these results help investigators worldwide to better tackle this horrific phenomenon and that this research can be useful in devising effective strategies to break down these criminal rings.

Ethics statement

The original data were handled only by Brazilian Federal Police Officers with legal clearance to do so, and under the supervision of a Federal Judge and Prosecutors. All data handling was in accordance with the Brazilian law for data protection (Act No. 13,709 from 2,018), the Brazilian individual rights act (Brazilian Constitution from 1,988), the Brazilian Criminal Code (Act No. 2,848 from 1,940), the Brazilian Criminal Procedure Code (Act No. 3,689 from 1,941), and the Brazilian Federal Police internal procedures. All data were analysed only after a complete cryptographic anonymization procedure.

Data availability

The network data studied in this paper are available in the Supplementary Datasets 1 and 2 along with a Supplementary Information file explaining it.


  1. 1.

    Ozkaya, E., Islam, R. & Islam, R. Inside the Dark Web. (CRC Press, 2019).

  2. 2.

    Gehl, R. W. Weaving the dark web: legitimacy on freenet, Tor, and I2P (The MIT Press, 2018).

  3. 3.

    TorProject. Anonymity Online, (2019).

  4. 4.

    Owen, G. & Savage, N. Empirical analysis of Tor Hidden Services. IET Inf. Secur. 10, 113–118, (2016).

    Article  Google Scholar 

  5. 5.

    BBC. Brazil police crack ‘darknet’ in child pornography crackdown, (2019).

  6. 6.

    Polícia Federal. Operacao Darknet – Balanco, (2019).

  7. 7.

    Polícia Federal. PF divulga balanço da Operação Darknet II — Notícias Antigas da Agência de PF, (2019).

  8. 8.

    National Center for Missing and Exploited Children. NCMEC, (2019).

  9. 9.

    Association of Sites Advocating Child Protection. White paper, (2019).

  10. 10.

    Bichler, G. Understanding Criminal Networks: a research guide. (University of California Press, 2019).

  11. 11.

    Johnson, S. D. et al. Evaluation of operation swordfish: a near-repeat target-hardening strategy. J. Exp. Criminol. 13, 505–525, (2017).

    Article  Google Scholar 

  12. 12.

    Schneider, É. M., Gonçalves, S., Iglesias, J. R. & da Cunha, B. R. Dynamic Modular Networks Model Mediated by Confinement. Appl. Netw. Sci. 4, 30, (2019).

    Article  Google Scholar 

  13. 13.

    da Cunha, B. R. & Gonçalves, S. Topology, robustness, and structural controllability of the Brazilian Federal Police criminal intelligence network. Appl. Netw. Sci. 3, 36, (2018).

    Article  PubMed  PubMed Central  Google Scholar 

  14. 14.

    Ribeiro, H. V., Alves, L. G. A., Martins, A. F., Lenzi, E. K. & Perc, M. The dynamical structure of political corruption networks. J. Complex Networks, (2018).

    MathSciNet  Article  Google Scholar 

  15. 15.

    Oliveira, M., Ribeiro, E., Bastos-Filho, C. & Menezes, R. Spatio-temporal variations in the urban rhythm: the travelling waves of crime. EPJ Data Sci. 7, 29, 10.1140/epjds/s13688-018-0158-4 (2018).

  16. 16.

    Barabási, A.-L. & Pósfai, M. Network science. (Cambridge University Press, 2016).

  17. 17.

    Duijn, P. A., Kashirin, V. & Sloot, P. M. The relative ineffectiveness of criminal network disruption. Sci. Reports 4, 4238, (2014).

    ADS  CAS  Article  Google Scholar 

  18. 18.

    Girvan, M. & Newman, M. E. J. Community structure in social and biological networks. Proct. Natl. Acad. Sci. USA 99, 7821–7826, (2001).

    ADS  MathSciNet  Article  MATH  Google Scholar 

  19. 19.

    Traag, V. A., Waltman, L. & van Eck, N. J. From Louvain to Leiden: guaranteeing well-connected communities. Sci. Reports 9, 5233, (2019).

    ADS  CAS  Article  Google Scholar 

  20. 20.

    Blondel, V. D., Guillaume, J. L., Lambiotte, R. & Lefebvre, E. Fast unfolding of communities in large networks. J. Stat. Mech. Theory Exp. 2008, P10008, (2008).

    Article  MATH  Google Scholar 

  21. 21.

    Rosvall, M. & Bergstrom, C. T. Maps of random walks on complex networks reveal community structure. Proc. Natl. Acad. Sci. 105, 1118–1123, (2008).

    ADS  Article  PubMed  Google Scholar 

  22. 22.

    Albert, R., Hawoong, J. & Barabási, L. Error and attack tolerance of complex networks. Nature 406, 378–382, (2000).

    ADS  CAS  Article  PubMed  Google Scholar 

  23. 23.

    Jeong, H., Mason, S. P., Barabási, A. L. & Oltvai, Z. N. Lethality and centrality in protein networks. Nature 411, 41–42, (2001).

    ADS  CAS  Article  PubMed  Google Scholar 

  24. 24.

    Albert, R. & szló Barabási, A.-L. Statistical Mechanics of Complex Networks. Rev. Mod. Phys. 625, 47–97, (2003).

    Article  Google Scholar 

  25. 25.

    Anderson, D. & Burnham, K. Model selection and multi-model inference. Second. NY: Springer-Verlag 63 (2004).

  26. 26.

    Borgatti, S. P. & Everett, M. G. Models of core/periphery structures. Soc. Networks 21, 375–395, (2000).

    Article  Google Scholar 

  27. 27.

    Opsahl, T., Colizza, V., Panzarasa, P. & Ramasco, J. J. Prominence and Control: The Weighted Rich-Club Effect. Phys. Rev. Lett. 101, 168702, (2008).

    ADS  CAS  Article  PubMed  Google Scholar 

  28. 28.

    Alstott, J., Panzarasa, P., Rubinov, M., Bullmore, E. T. & Vértes, P. E. A Unifying Framework for Measuring Weighted Rich Clubs. Sci. Reports 4, 7258, (2015).

    CAS  Article  Google Scholar 

  29. 29.

    Zhou, S. & Mondragon, R. The Rich-Club Phenomenon in the Internet Topology. IEEE Commun. Lett. 8, 180–182, (2004).

    Article  Google Scholar 

  30. 30.

    McAuley, J. J., da Fontoura Costa, L. & Caetano, T. S. Rich-club phenomenon across complex network hierarchies. Appl. Phys. Lett. 91, 084103, (2007).

    ADS  CAS  Article  Google Scholar 

  31. 31.

    Viger, F. & Latapy, M. Efficient and simple generation of random simple connected graphs with prescribed degree sequence. J. Complex. Networks 4, 15–37, (2016).

    MathSciNet  Article  MATH  Google Scholar 

  32. 32.

    Hu, H.-B. & Wang, X.-F. Disassortative mixing in online social networks. EPL Europhysics Lett. 86, 18003, (2009).

    ADS  Article  Google Scholar 

  33. 33.

    Braunstein, A., Dall’Asta, L., Semerjian, G. & Zdeborová, L. Network dismantling. Proc. Natl. Acad. Sci. 113, 201605083, (2016).

    CAS  Article  Google Scholar 

  34. 34.

    Morone, F. & Makse, H. A. Influence maximization in complex networks through optimal percolation. Nature 524, 65–68, (2015).

    ADS  CAS  Article  PubMed  Google Scholar 

  35. 35.

    Morselli, C. Inside Criminal Networks, vol. 8 of Studies of Organized Crime (Springer New York, New York, NY, 2009).

  36. 36.

    da Cunha, B. R. & Gonçalves, S. Performance of attack strategies on modular networks. J. Complex Networks 5, 913–923, (2017).

    Article  Google Scholar 

  37. 37.

    Zdeborová, L., Zhang, P. & Zhou, H.-J. Fast and simple decycling and dismantling of networks. Sci. Reports 6, 37954, (2016).

    ADS  CAS  Article  Google Scholar 

  38. 38.

    Mugisha, S. & Zhou, H.-J. Identifying optimal targets of network attack by belief propagation. Phys. Rev. E 94, 012305, 10.1103/PhysRevE.94.012305 (2016).

  39. 39.

    Morone, F., Min, B., Bo, L., Mari, R. & Makse, H. A. Collective Influence Algorithm to find influencers via optimal percolation in massively large social media. Sci. Reports 6, 30062, (2016).

    ADS  CAS  Article  Google Scholar 

  40. 40.

    Tian, L., Bashan, A., Shi, D.-N. & Liu, Y.-Y. Articulation points in complex networks. Nat. Commun. 8, 14223, (2017).

    ADS  CAS  Article  PubMed  PubMed Central  Google Scholar 

  41. 41.

    da Cunha, B. R., González-Avella, J. C. & Gonçalves, S. Fast fragmentation of networks using module-based attacks. PLoS One 10, e0142824, (2015).

    CAS  Article  Google Scholar 

  42. 42.

    Islamic State Group - UCINET Software,

  43. 43.

    Weeks, M. R., Clair, S., Borgatti, S. P., Radda, K. & Schensul, J. J. Social Networks of Drug Users in High-Risk Sites: Finding the Connections. AIDS Behav. 6, 193–206, (2002).

    Article  Google Scholar 

  44. 44.

    Gill, P., Lee, J., Rethemeyer, K. R., Horgan, J. & Asal, V. Lethal Connections: The Determinants of Network Connections in the Provisional Irish Republican Army, 1970–1998. Int. Interactions 40, 52–78, (2014).

    Article  Google Scholar 

  45. 45.

    FIFA - UCINET Software,

  46. 46.

    Italian Gangs - UCINET Software,

  47. 47.

    Krebs, V. E. Mapping Networks of Terrorist Cells. Connections 24, 43–52, (2002).

Download references


B.R.C., K.A.O. and J.G. acknowledge the Science Foundation Ireland (grants 16/IA/4470 and 12/RC/2289P2) for financial support. P.M.C. is supported by the European Research Council (grant 802421). The authors also thank Brazilian Federal Policemen Jair Soares Fonseca Filho and Fernando Casarin, and the Brazilian Federal Judge Ricardo Humberto Silva Bourne.

Author information




B.R.C. design, simulation, data, analysis, discussion and writing; P.M.C. and K.A.O. simulation, analysis, discussion and writing; J.F.P. and L.W.S.J. data and discussion; J.G. discussion and writing. All authors revised and approved the manuscript.

Corresponding author

Correspondence to Bruno Requião da Cunha.

Ethics declarations

Competing interests

B.R.C., J.F.P. and L.W.S.J. are Brazilian Federal Police Officers and were members of the investigative team of the Operation Darknet. Besides that, the authors have no competing interests.

Additional information

Publisher’s note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Supplementary information

Rights and permissions

Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this license, visit

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

da Cunha, B.R., MacCarron, P., Passold, J.F. et al. Assessing police topological efficiency in a major sting operation on the dark web. Sci Rep 10, 73 (2020).

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI:

Further reading


By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.


Quick links

Nature Briefing

Sign up for the Nature Briefing newsletter — what matters in science, free to your inbox daily.

Get the most important science stories of the day, free in your inbox. Sign up for Nature Briefing