arXiv — Machine Learning · · 3 min read

Optimal Transport for Network Comparison: A Review with Machine Learning Applications

Mirrored from arXiv — Machine Learning for archival readability. Support the source by reading on the original site.

Statistics > Machine Learning

arXiv:2608.27500 (stat)
[Submitted on 27 Aug 2026]

Title:Optimal Transport for Network Comparison: A Review with Machine Learning Applications

View a PDF of the paper titled Optimal Transport for Network Comparison: A Review with Machine Learning Applications, by James Hyun and Fran\c{c}ois G. Meyer
View PDF HTML (experimental)
Abstract:Network comparison using optimal transport is a growing area of research in network science. Unlike standard graph metrics, optimal transport computes both network dissimilarity and a transport plan that explains how one graph morphs into another. In this paper, we review how optimal transport compares undirected, unweighted graphs using three primary distances: the Wasserstein, Gromov-Wasserstein, and Bures-Wasserstein distances. We examine the closed form of the Wasserstein distance in one dimension via node feature probability distributions, and show how the transport plans of the Wasserstein and Gromov-Wasserstein distances capture which specific nodes influence the distance after graph perturbation. For the Bures-Wasserstein distance, we derive bounds using Laplacian spectra to bypass full spectral decompositions. Finally, we evaluate these distances using a synthetic network dataset for clustering and a real-world time series network for anomaly detection.
Subjects: Machine Learning (stat.ML); Machine Learning (cs.LG); Social and Information Networks (cs.SI)
Cite as: arXiv:2608.27500 [stat.ML]
  (or arXiv:2608.27500v1 [stat.ML] for this version)
  https://doi.org/10.48550/arXiv.2608.27500
arXiv-issued DOI via DataCite

Submission history

From: Seunghyeok Hyun [view email]
[v1] Thu, 27 Aug 2026 02:13:27 UTC (2,338 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled Optimal Transport for Network Comparison: A Review with Machine Learning Applications, by James Hyun and Fran\c{c}ois G. Meyer
  • View PDF
  • HTML (experimental)
  • TeX Source

Current browse context:

stat.ML
< prev   |   next >
Change to browse by:

References & Citations

Loading...

BibTeX formatted citation

loading...
Data provided by:

Bookmark

BibSonomy Reddit
Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle
alphaXiv (What is alphaXiv?)
Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub Toggle
DagsHub (What is DagsHub?)
GotitPub Toggle
Gotit.pub (What is GotitPub?)
Huggingface Toggle
Hugging Face (What is Huggingface?)
ScienceCast Toggle
ScienceCast (What is ScienceCast?)
Demos

Demos

Replicate Toggle
Replicate (What is Replicate?)
Spaces Toggle
Hugging Face Spaces (What is Spaces?)
Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
Related Papers

Recommenders and Search Tools

Link to Influence Flower
Influence Flower (What are Influence Flowers?)
Core recommender toggle
CORE Recommender (What is CORE?)
About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Discussion (0)

Sign in to join the discussion. Free account, 30 seconds — email code or GitHub.

Sign in →

No comments yet. Sign in and be the first to say something.

More from arXiv — Machine Learning