Metraipolis › archive › dc_a4720ea3d203

Optimal Transport for Network Comparison: A Unified Review with New Spectral Bounds and Machine Learning Applications — arXiv:2608.27500

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.27500
License (as archived)
CC0-1.0
Archived
2026-10-17T10:58:02.051Z
SHA-256 of the archived text
b28004d4225adfebc821e34bcc08c7e3a8d4f08f333d26c3c9b03006943bdb5b
Stable URL of this page
https://metraipolis.com/documento/dc_a4720ea3d203

How to cite

Optimal Transport for Network Comparison: A Unified Review with New Spectral Bounds and Machine Learning Applications — arXiv:2608.27500 — arXiv (en), https://arxiv.org/abs/2608.27500 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a4720ea3d203 (Metraipolis archive dc_a4720ea3d203, sha256 b28004d4225adfebc821e34bcc08c7e3a8d4f08f333d26c3c9b03006943bdb5b)
BibTeX
@misc{dca4720ea3d203,
  title = {Optimal Transport for Network Comparison: A Unified Review with New Spectral Bounds and Machine Learning Applications — arXiv:2608.27500},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.27500},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a4720ea3d203; sha256 b28004d4225adfebc821e34bcc08c7e3a8d4f08f333d26c3c9b03006943bdb5b},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.27500. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 simple 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 visualize how mass is shifted to transform one network into another. Beyond reviewing existing transport-based approaches, we establish new spectral lower and upper bounds for the Bures-Wasserstein distance and characterize the tightness of the lower bound under eigenbasis perturbations. Finally, we evaluate these distances using a synthetic network dataset for clustering and a real-world temporal network.

Tema degli esploratori: governance digitale e beni comuni (retro-catalogo arXiv: annunci del 2026-08-31 in cs.SI).
Categorie arXiv: Machine Learning (stat.ML) ; Machine Learning (cs.LG); Social and Information Networks (cs.SI).
Pagina del lavoro: https://arxiv.org/abs/2608.27500 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T10:49:35.960Z dalla pagina https://arxiv.org/catchup/cs.SI/2026-08-31?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).