社交网络的去匿名化有两种情况:seeded 和 seedless
在seeded情况中,有一部分节点的已经被预先标注(根据具体任务定义,比如归属者)。此时,针对整体节点的去匿名化常常使用bootstrap percolation。有四篇典型论文
1.On the performance of percolation graph matching
Lyudmila Yartseva and Matthias Grossglauser. 2013. On the performance of percolation graph matching. In Proceedings of the first ACM conference on Online social networks (COSN ’13). Association for Computing Machinery, New York, NY, USA, 119–130. DOI:https://doi.org/10.1145/2512938.2512952
2.Bootstrap percolation in power-law random graphs
Amini H , Fountoulakis N . Bootstrap Percolation in Power-Law Random Graphs[J]. Journal of Statistical Physics, 2014, 155(1):72-92.
3.An efficient reconciliation algorithm for social networks
Korula N , Lattanzi S . An efficient reconciliation algorithm for social networks[J]. 2014.
4.Community-enhanced deanonymization of online social networks
Nilizadeh, Shirin & Kapadia, Apu & Ahn, Y.-Y. (2014). Community-Enhanced De-anonymization of Online Social Networks. Proceedings of the ACM Conference on Computer and Communications Security. 537-548. 10.1145/2660267.2660324.