Problem
Research questions and friction points this paper is trying to address.
Optimal Transport
Network Comparison
Graph Metrics
Optimal Transport for Network Comparison: A Review with Machine Learning Applications
🤖 AI Summary
本文使用最优传输方法（包括Wasserstein、Gromov-Wasserstein和Bures-Wasserstein距离）解决网络比较问题，并通过合成数据集和真实时间序列网络评估这些方法。
📝 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.
Innovation
Methods, ideas, or system contributions that make the work stand out.
Optimal Transport
Network Comparison
Wasserstein Distance
Gromov-Wasserstein Distance
Bures-Wasserstein Distance
🔎 Similar Papers
No similar papers found.
