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
Title:Optimal Transport for Network Comparison: A Review with Machine Learning Applications
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
|
Access Paper:
- View PDF
- HTML (experimental)
- TeX Source
Current browse context:
References & Citations
Bookmark
Bibliographic and Citation Tools
Code, Data and Media Associated with this Article
Demos
Recommenders and Search Tools
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.
More from arXiv — Machine Learning
-
Fundamental Dynamical Units for Physics-Informed Structural Inference from Perturbation Time-Series in Networked Systems
Sep 14
-
Physics-Informed Conformal Prediction: Embedding PDE Consistency into Distribution-Free Uncertainty Quantification for Neural Operators
Sep 14
-
Fed-Equilibrium Framework for Topological Pareto Control in Robust and Fair Clinical Federated Learning
Sep 14
-
Efficient AI Model Deployment Using Quantization Analysis Tool
Sep 14
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.