Reproduce “Graph Similarity Meets Optimal Transport” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Jens Breitung, Timo Gervens, Martin Grohe
The authors compare bijective and fractional graph distances defined by several matrix norms. They prove that edit distance changes by at most a factor of two, while local-edit and spectral distances lack linear bounds. For equal-order graphs, fractional cut distance can halve the bijective score, and the authors give an almost-linear upper relationship; a universal factor-two upper bound remains open.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.