Back to papers
Efficient and Effective Biclique Counting with Local Differential Privacy
Summary: Edge-LDP (p,q)-biclique counting in bipartite graphs. Key novelty: moment-based Multi-round Common Neighbor estimator with variance reduction and pruning, yielding unbiased counts without explicit motif enumeration; substantially better utility/scalability than naive randomized-response.
(summarized by gpt-5.4-mini on Apr 11 2026)
- Paper ID
- 7468
- Venue
- SIGMOD
- Year
- 2026
- Pagerank
- 4.1945683e-05
- Overall Rank
- 10,157 | 29.34%
- DOI
-
10.1145/3786642
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
Outgoing Citations (Sorted by Pagerank)
Showing 15 of 15 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 178 |
Boosting the Accuracy of Differentially Private Histograms Through Consistency |
2010 |
VLDB |
0.00037697111 |
| 642 |
Private Analysis of Graph Structure |
2011 |
VLDB |
0.00018755196 |
| 1,484 |
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks |
2019 |
VLDB |
0.00011714263 |
| 2,226 |
Publishing Graph Degree Distribution with Node Differential Privacy |
2016 |
SIGMOD |
9.2421776e-05 |
| 2,683 |
Private Release of Graph Statistics using Ladder Functions |
2015 |
SIGMOD |
8.315553e-05 |
| 2,903 |
(p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs |
2022 |
VLDB |
7.9375744e-05 |
| 4,626 |
Efficient Biclique Counting in Large Bipartite Graphs |
2023 |
SIGMOD |
6.0399035e-05 |
| 5,396 |
LDPTrace: Locally Differentially Private Trajectory Synthesis |
2023 |
VLDB |
5.5301599e-05 |
| 5,474 |
Efficient Load-Balanced Butterfly Counting on GPU |
2022 |
VLDB |
5.4881807e-05 |
| 5,540 |
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs |
2021 |
VLDB |
5.4498271e-05 |
| 5,773 |
I/O-Efficient Butterfly Counting at Scale |
2023 |
SIGMOD |
5.3319911e-05 |
| 6,259 |
Neural Attributed Community Search at Billion Scale |
2023 |
SIGMOD |
5.1355079e-05 |
| 8,234 |
Robust Privacy-Preserving Triangle Counting under Edge Local Differential Privacy |
2025 |
SIGMOD |
4.5535352e-05 |
| 8,821 |
Efficient Unsupervised Community Search with Pre-trained Graph Transformer |
2024 |
VLDB |
4.4417735e-05 |
| 9,405 |
Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy |
2024 |
SIGMOD |
4.3441378e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 4,459 |
Efficient Bi-triangle Counting for Large Bipartite Networks |
2021 |
VLDB |
6.1651553e-05 |
| 3,492 |
Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs |
2022 |
VLDB |
7.044442e-05 |
| 4,626 |
Efficient Biclique Counting in Large Bipartite Graphs |
2023 |
SIGMOD |
6.0399035e-05 |
| 6,235 |
Global and Local Differentially Private Release of Count-Weighted Graphs |
2023 |
SIGMOD |
5.1451658e-05 |
| 2,903 |
(p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs |
2022 |
VLDB |
7.9375744e-05 |
| 10,300 |
Scalable Approximate Biclique Counting over Large Bipartite Graphs |
2026 |
VLDB |
4.1945683e-05 |
| 10,078 |
Estimating Biclique Counts with Accuracy Guarantees |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,727 |
Practical and Accurate Local Edge Differentially Private Graph Algorithms |
2025 |
VLDB |
4.1945683e-05 |
| 8,234 |
Robust Privacy-Preserving Triangle Counting under Edge Local Differential Privacy |
2025 |
SIGMOD |
4.5535352e-05 |
| 9,405 |
Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy |
2024 |
SIGMOD |
4.3441378e-05 |