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
- 7469
- Venue
- SIGMOD
- Year
- 2026
- Pagerank
- 4.1905499e-05
- Overall Rank
- 10,157 | 29.41%
- 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.00037726596 |
| 642 |
Private Analysis of Graph Structure |
2011 |
VLDB |
0.00018757732 |
| 1,484 |
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks |
2019 |
VLDB |
0.00011705344 |
| 2,224 |
Publishing Graph Degree Distribution with Node Differential Privacy |
2016 |
SIGMOD |
9.256869e-05 |
| 2,686 |
Private Release of Graph Statistics using Ladder Functions |
2015 |
SIGMOD |
8.31087e-05 |
| 2,908 |
(p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs |
2022 |
VLDB |
7.92992e-05 |
| 4,626 |
Efficient Biclique Counting in Large Bipartite Graphs |
2023 |
SIGMOD |
6.0340995e-05 |
| 5,403 |
LDPTrace: Locally Differentially Private Trajectory Synthesis |
2023 |
VLDB |
5.5248422e-05 |
| 5,483 |
Efficient Load-Balanced Butterfly Counting on GPU |
2022 |
VLDB |
5.4829054e-05 |
| 5,548 |
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs |
2021 |
VLDB |
5.4445937e-05 |
| 5,782 |
I/O-Efficient Butterfly Counting at Scale |
2023 |
SIGMOD |
5.3268721e-05 |
| 6,259 |
Neural Attributed Community Search at Billion Scale |
2023 |
SIGMOD |
5.1305787e-05 |
| 8,141 |
Robust Privacy-Preserving Triangle Counting under Edge Local Differential Privacy |
2025 |
SIGMOD |
4.5724134e-05 |
| 8,821 |
Efficient Unsupervised Community Search with Pre-trained Graph Transformer |
2024 |
VLDB |
4.437516e-05 |
| 9,411 |
Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy |
2024 |
SIGMOD |
4.3399748e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 4,460 |
Efficient Bi-triangle Counting for Large Bipartite Networks |
2021 |
VLDB |
6.1592411e-05 |
| 3,496 |
Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs |
2022 |
VLDB |
7.0376611e-05 |
| 4,626 |
Efficient Biclique Counting in Large Bipartite Graphs |
2023 |
SIGMOD |
6.0340995e-05 |
| 6,231 |
Global and Local Differentially Private Release of Count-Weighted Graphs |
2023 |
SIGMOD |
5.1402278e-05 |
| 2,908 |
(p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs |
2022 |
VLDB |
7.92992e-05 |
| 10,312 |
Scalable Approximate Biclique Counting over Large Bipartite Graphs |
2026 |
VLDB |
4.1905499e-05 |
| 10,078 |
Estimating Biclique Counts with Accuracy Guarantees |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,734 |
Practical and Accurate Local Edge Differentially Private Graph Algorithms |
2025 |
VLDB |
4.1905499e-05 |
| 8,141 |
Robust Privacy-Preserving Triangle Counting under Edge Local Differential Privacy |
2025 |
SIGMOD |
4.5724134e-05 |
| 9,411 |
Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy |
2024 |
SIGMOD |
4.3399748e-05 |