Structural Attack to Anonymous Graph of Social Networks

Algorithm 1

𝑛-hop neighbor feature for node reidentification.

Input: 𝐺_𝐴 and 𝐺_𝑇: the auxiliary graph and target anonymous graph

Output: node mapping between 𝐺_𝐴 and 𝐺_𝑇

Initialize the original mapping and temperature T;

while (Temperature 𝑇 > Threshold 𝑇_min)

Exchange two nodes position to make a new mapping;

  if (the Euclidian distance of the new mapping < the Euclidian distance of old mapping)

   Accept the changing of nodes position;

  else

   Accept it with a probability 𝑒^{−Δ𝑝/𝑐∗𝑇};

  endif

  Decrease the temperature 𝑇 with a rate;

endwhile