Research map / Graph learning / Graph algorithms and clustering
Seeded Graph Matching for the Correlated Gaussian Wigner Model via the Projected Power Method
Ernesto Araya, Guillaume Braun, Hemant Tyagi
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 |
|---|---|---|---|
| add PPMGM refinement on top of Grampa and Umeyama seedless outputs | Grampa, Umeyama · CGW synthetic graphs, n=800 | recovery fraction | Improved |
| add PPMGM refinement on SHREC'16 shape matching | Grampa · SHREC'16 low-resolution | percentage of nodes correctly matched: less than 15% -> more than 50% | Improved |
| add PPMGM refinement to QPADMM | QPADMM · CGW synthetic graphs | recovery fraction | Improved |
| increase PPMGM iterations N from 1 to 30 (ablation) | PPMGM · CGW synthetic graphs, n=500 | recovery rate | Mixed |
| increase matrix size from n=500 to n=1000 with multiple iterations (ablation) | PPMGM · CGW synthetic graphs | recovery rate gain from N>1 | No clear effect |
| use sparsified inputs instead of full weighted matrices (ablation) | PPMGM · CGW synthetic graphs, high noise, low seed overlap | recovery rate | Hurt |
| use a better seed (higher initial overlap) (ablation) | PPMGM · CGW synthetic graphs, n=800 | recovery and variance | Improved |
Closest papers by meaning
- Efficient Graph Matching for Correlated Stochastic Block Models (NeurIPS 2024 · similarity 0.88)
- Sample Complexity of Correlation Detection in the Gaussian Wigner Model (ICML 2025 · similarity 0.87)
- Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS (ICML 2024 · similarity 0.86)
- Node Similarities under Random Projections: Limits and Pathological Cases (ICLR 2025 · similarity 0.86)
- Graph Alignment via Birkhoff Relaxation (NeurIPS 2025 · similarity 0.85)
- Learning Partial Graph Matching via Optimal Partial Transport (ICLR 2025 · similarity 0.85)
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.
