Table 1 Mapping to percolation. We demonstrate and provide brief explanations on the various measures used and how they relate to the traditional measures from percolation theory
From: Percolation framework reveals limits of privacy in conspiracy, dark web, and blockchain networks
Parameter | Percolation Theory Definition | Privacy Interpretation |
|---|---|---|
p | Fraction of occupied links | Probability a node can identify its neighbors |
S | Giant connected component (GCC) | Largest group of mutually vulnerable nodes |
SG | Second largest component | Second largest group of vulnerable nodes |
\(p_{c}\) | Critical point | p for which deanonymization is feasible |
\(n_{\mathrm{comp}}\) | Num. Components | Min. num. of sources to identify whole network |
l | Shortest Path Length | Optimal number of interrogations |
\(\ell _{\mathrm{actual}}\) | Greedy Algorithm Path Length | Realistic number of interrogations |