Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy
Summary: Estimates common neighbors in bipartite graphs under edge LDP. Proposes a multi-round pruning framework with unbiased local estimators, leveraging neighbors of both query vertices, optimized privacy-budget allocation boosts accuracy under degree imbalance. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yizhang He
- 2. Kai Wang
- 3. Wenjie Zhang
- 4. Xuemin Lin
- 5. Ying Zhang
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,153 | Defense against Poisoning Attacks under Shuffle-DP | 2026 | SIGMOD | 4.1945683e-05 |
| 10,157 | Efficient and Effective Biclique Counting with Local Differential Privacy | 2026 | SIGMOD | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 11 of 11 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next