An efficient reconciliation algorithm for social networks
Summary: Formalizes cross-network identity reconciliation, with a simple, local parallel algorithm using few seed links to merge accounts. Provides strong guarantees on Random Graphs and Preferential Attachment; validated on synthetic and real networks. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Nitish Korula
- 2. Silvio Lattanzi
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,209 | Keys for Graphs | 2015 | VLDB | 7.7101103e-05 |
| 11,600 | SLIM: Scalable Linkage of Mobility Data | 2020 | SIGMOD | 5.1725247e-05 |
| 11,934 | Growing a Graph Matching from a Handful of Seeds | 2015 | VLDB | 5.1725247e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next