Figure 2
From: The effect of distant connections on node anonymity in complex networks
Uniqueness maps using d-k-anonymity. Maps show network uniqueness, indicated by color, when using information of the 1-neighborhood (top row) and 2-neighborhood (bottom row). Results are shown for the Erdős–Rényi (left), Barabási–Albert (middle) and Watts–Strogatz (right) model with different sizes (horizontal axis) and average degree or m, an equivalent thereof (vertical axis).
