Research map / Graph learning / Graph algorithms and clustering
GOT: An Optimal Transport framework for Graph comparison
Hermina Petric Maretic, Mireille El Gheche, Giovanni Chierchia, Pascal Frossard
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 Wasserstein distance between smooth graph signal distributions (GOT) instead of Euclidean distance on Laplacians (ablation) | stochastic graph alignment · distorted SBM graph alignment (40 nodes, 4 communities) | community detection NMI | Improved |
| GOT instead of Gromov-Wasserstein for alignment | graph alignment · distorted SBM graph alignment | GW's own error measure | Hurt |
| GOT instead of GW, FGM, IPFP, RRWM, NetLSD | 1-NN graph classification · random graph models (SBM2, SBM3, RG, BA, WS) | accuracy | Improved |
Closest papers by meaning
- Hypergraph Learning for Unsupervised Graph Alignment via Optimal Transport (AAAI 2025 · similarity 0.87)
- Transfer Learning on Edge Connecting Probability Estimation Under Graphon Model (NeurIPS 2025 · similarity 0.86)
- Aligning Embeddings and Geometric Random Graphs: Informational Results and Computational Approaches for the Procrustes-Wasserstein Problem (NeurIPS 2024 · similarity 0.86)
- An Efficient Orlicz-Sobolev Approach for Transporting Unbalanced Measures on a Graph (NeurIPS 2025 · similarity 0.86)
- Generalized Sobolev Transport for Probability Measures on a Graph (ICML 2024 · 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.
