Research map / Graph learning / Graph algorithms and clustering
Private Graph All-Pairwise-Shortest-Path Distance Release with Improved Error Rate
Chenglin Fan, Ping Li, Xiaoyun Li
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use Laplace noise with positive mean instead of zero-mean noise, plus shortcut augmentation | private APSP release algorithm · weight-private general graphs | max absolute distance error bound | Improved |
| edge weights drawn from Unif(10^4, 10^5) instead of Unif(2000, 3000) | private APSP release algorithm · multi-stage synthetic graph | tightness of empirical error vs bound | Improved |
| vary privacy parameter epsilon over 0.1, 0.5, 1 | private APSP release algorithm · multi-stage synthetic graph | empirical error growth with n | No clear effect |
| exploit small feedback vertex set number k in the graph | private APSP release algorithm · graphs with k = o(n^1/2) | error rate | Improved |
Closest papers by meaning
- Differentially Private Gomory-Hu Trees (NeurIPS 2025 · similarity 0.85)
- Publishing Below-Threshold Triangle Counts under Local Weight Differential Privacy (NeurIPS 2026 · similarity 0.84)
- On the Price of Differential Privacy for Hierarchical Clustering (ICLR 2025 · similarity 0.83)
- Differentially Private Graph Diffusion with Applications in Personalized PageRanks (NeurIPS 2024 · similarity 0.82)
- Private Geometric Median (NeurIPS 2024 · similarity 0.81)
- Differentially Private Decentralized Learning with Random Walks (ICML 2024 · similarity 0.81)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
