arXiv Machine Learning
Edgewise Envelopes Between Balanced Forman and Ollivier-Ricci Curvature
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv AI
Aug 26
Ollivier-Ricci Curvature of Riemannian Manifolds and Directed Graphs with Applications to Graph Neural Networks
arXiv:2604.14211v2 Announce Type: replace-cross Abstract: This thesis is an exposition of Ollivier-Ricci Curvature of metric spaces as introduced by Yann Ollivier, which is based upon the 1-Wasserste...
arXiv Machine Learning
Jul 27
Local-Global Geometric Insights for Graph Neural Networks via Entropic Curvature
arXiv:2607. 22381v1 Announce Type: new Abstract: Curvature notions on graphs, particularly Ollivier-Ricci and Forman, have emerged as powerful tools for addressing fundamental issues in Graph Neural Networks (GNNs) such as oversmoothing and oversquashing, but rely almost exclusively on local edge-level comparisons and therefore fail to certify how information actually propagates over long distances.
arXiv Machine Learning
Jun 30
A Residual-Shell-Based Lower Bound for Ollivier-Ricci Curvature
arXiv:2604. 12211v2 Announce Type: replace Abstract: Ollivier-Ricci curvature (ORC), defined via the Wasserstein distance that captures rich geometric information, has received growing attention in both theory and applications.
arXiv Machine Learning
Sep 15
Optimal Transport for Network Comparison: A Unified Review with New Spectral Bounds and Machine Learning Applications
arXiv:2608.27500v3 Announce Type: replace-cross Abstract: Network comparison using optimal transport is a growing area of research in network science. Unlike standard graph metrics, optimal transport...
arXiv Machine Learning
Aug 31
Optimal Transport for Network Comparison: A Review with Machine Learning Applications
The paper reviews the use of optimal transport for comparing undirected, unweighted graphs, focusing on three main distances: Wasserstein, Gromov-Wasserstein, and Bures-Wasserstein. It discusses closed-form solutions for the Wasserstein distance in one dimension, how transport plans identify influential nodes after perturbations, and derives spectral bounds for the Bures-Wasserstein distance to avoid full decompositions. The authors evaluate these distances on synthetic clustering data and a real-world time‑series network for anomaly detection.
arXiv Machine Learning
Sep 23
Statistical Rates for Entropic Optimal Transport in the Discrete to SubGaussian Regime
arXiv:2609. 26647v1 Announce Type: cross Abstract: We study statistical rates in entropic optimal transport in the semi-discrete regime where one measure has finite support and the other is subGaussian.