Research map / Graph learning / Graph algorithms and clustering
Communication-Optimal Distributed Dynamic Graph Clustering
Chun Jiang Zhu, Tan Zhu, Kam-Yiu Lam, Song Han, Jinbo Bi
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 D²-CAMP instead of CNTRL | Distributed dynamic clustering on Gaussians · Gaussians | communication cost: on average 16% of that of CNTRL | Improved |
| Use D²-CABL instead of CNTRL | Distributed dynamic clustering on Gaussians · Gaussians | communication cost: on average 11% of CNTRL | Improved |
| Use D²-CAMP instead of CNTRL | Distributed dynamic clustering on Sculpture · Sculpture | communication cost: on average 49% of that of CNTRL | Improved |
| Use D²-CABL instead of CNTRL | Distributed dynamic clustering on Sculpture · Sculpture | communication cost: on average 21% of CNTRL | Improved |
| Use D²-CAMP or D²-CABL instead of CNTRL | Distributed dynamic clustering · Gaussians and Sculpture | NCut | No clear effect |
| Use D²-CABL instead of D²-CAMP | Distributed dynamic clustering · Gaussians and Sculpture | communication cost | Improved |
| Increase the number of sites from 15 to 60 | D²-CAMP · Gaussians and Sculpture | communication cost | Hurt |
| Increase the number of sites from 15 to 60 | D²-CABL · Gaussians and Sculpture | communication cost | No clear effect |
| Increase the number of time points from 10 to 300 | D²-CAMP and D²-CABL · Gaussians and Sculpture | communication cost | No clear effect |
| Ignore 5% of edge deletions rather than processing and transmitting them | D²-CAMP and D²-CABL · Dynamic graph streams, Gaussians and Sculpture | NCut | No clear effect |
| Ignore 5% of edge deletions rather than processing and transmitting them | D²-CAMP and D²-CABL · Dynamic graph streams, Gaussians and Sculpture | communication cost: 5% | Improved |
Closest papers by meaning
- Faster Dynamic Graph Clustering with Hierarchical Graph Contraction (NeurIPS 2026 · similarity 0.90)
- Dynamic Correlation Clustering in Sublinear Update Time (ICML 2024 · similarity 0.88)
- Dynamic Spectral Clustering with Provable Approximation Guarantee (ICML 2024 · similarity 0.88)
- Optimal Graph Clustering without Edge Density Signals (NeurIPS 2025 · similarity 0.87)
- Sparse-pivot: Dynamic correlation clustering for node insertions (ICML 2025 · similarity 0.87)
- Hierarchical Overlapping Clustering on Graphs: Cost Function, Algorithm and Scalability (ICML 2025 · similarity 0.86)
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.
