Skip to main content
Figure 2 | EPJ Data Science

Figure 2

From: Percolation framework reveals limits of privacy in conspiracy, dark web, and blockchain networks

Figure 2

Fraction of Reachable Nodes and Minimum Effort to reach them. (a)–(c) The fractional size of the largest, S, and second largest, SG, components in each of our three real networks. Points are averages of 100 realizations and error bars represent one standard deviation. For S the error bars are smaller than the size of the points. (d)–(f) The fraction of nodes, \(F_{l}\), reached at l steps (shortest path) for each of our networks. For the Blockchain Transaction Network we assume that a set of 10 nodes belonging to 5 exchange companies are sources, whereas for the Dark Web Network and the Conspiracy Network, we randomly select individual source nodes. For all 3 of our networks, the shortest paths are very short, with most reachable nodes, being identified within \(l\approx 3\) or ≈4 steps. Values of \(p\leq 0.1\) are shown only for the Dark Web because online interactions are less likely to involve identifying information

Back to article page