arXiv (OAI Expanded)
open access
Optimal Transport for Network Comparison: A Unified Review with New Spectral Bounds and Machine Learning Applications
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 compa
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Using geospatial data and machine learning methods for decision support in traffic management and transport planning / Jonas Hamann-Effertz ; Gutachter: Till Dannewald, Michał Suchanek ; Tobias Hagen, Marco Sunder#995888
- The Generalized Excursion Coupling as the Limit of Concave Optimal Transport#1071364
- An exact and fast solution of the inverse Regularized Optimal Transport problem#821231
- Traffic Engineering in Large-scale Networks with Generalizable Graph Neural Networks#1013412
- Hypernetwork science via high-order hypergraph walks#1159452
Record · ID 1084344
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive