Research map / Graph learning / Graph algorithms and clustering
Graphon based Clustering and Testing of Networks: Algorithms and Theory
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (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 degree-sorted, smoothed graphon distance for clustering instead of the compared graph kernels, graph statistics, and graph matching methods | DSC · Simulated graphon clustering | error rate | Helped |
| Use degree-sorted, smoothed graphon distance for clustering instead of the compared methods | DSC · Bioinformatics and Social Networks clustering | error rate | Helped |
| Use graphon-distance similarity with semi-definite programming rather than the compared clustering methods | SSDP · Simulated graphon clustering | error rate | Mixed |
| Use graphon-distance similarity with semi-definite programming rather than the compared clustering methods | SSDP · Bioinformatics and Social Networks clustering | error rate | Mixed |
| Replace the proposed graph distance in the two-sample test with log moments | Graph two-sample test · Simulated graphon pairs | test power | Hurt |
| Replace the proposed graph distance in the two-sample test with MMD | Graph two-sample test · Simulated graphon pairs | test power | Mixed |
| Use the proposed graph distance in the two-sample test | Graph two-sample test · Simulated graphon pairs | test power | Helped |
Closest papers by meaning
- Graph Minimum Factor Distance and Its Application to Large-Scale Graph Data Clustering (ICML 2025 · similarity 0.88)
- DGCLUSTER: A Neural Framework for Attributed Graph Clustering via Modularity Maximization (AAAI 2024 · similarity 0.88)
- Low-Rank Graphon Learning for Networks (NeurIPS 2025 · similarity 0.87)
- Online Sparsification of Bipartite-Like Clusters in Graphs (ICML 2025 · similarity 0.87)
- A Few Moments Please: Scalable Graphon Learning via Moment Matching (NeurIPS 2025 · similarity 0.87)
- Local Graph Clustering with Noisy Labels (ICLR 2024 · similarity 0.87)
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.