← Back to all news
arXiv Machine Learning By Elaheh Hassani, Durga Mandarapu, Qi Yu, Hanghang Tong, Ariful Azad

Scalable Optimal Transport Algorithm for Network Alignment

Read the original on arXiv Machine Learning →

arXiv:2607. 11952v1 Announce Type: new Abstract: Network alignment identifies node correspondences across different networks and is a fundamental primitive in many data science applications, including social network analysis, fraud detection, and knowledge graph integration.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

arXiv Machine Learning
Jun 2

Chaining 2-FWL GNNs for Combinatorial Graph Alignment

arXiv:2510. 03086v2 Announce Type: replace Abstract: For the combinatorial graph alignment problem (GAP) -- finding the node correspondence that maximizes the number of common edges (nce) between two unlabeled graphs -- properly initialized FAQ remains a strong classical baseline, while existing GNN approaches struggle in the purely structural setting.

By Marc Lelarge
ragbenchmarkssafety
More like this →
arXiv Machine Learning
Sep 30

Alignment Matters Inside and Out in Equivariant Graph Flow Matching

The paper investigates how alignment—both outer (choosing which graphs to pair) and inner (aligning node representatives)—affects permutation-equivariant graph flow matching. It connects inner alignment to transport on the graph quotient space and shows that quotient couplings can be lifted to aligned representatives, while symmetrization yields equivariant flow‑matching minimizers. Experiments on continuous graph and molecular generation demonstrate that appropriate alignment can simplify trajectories and improve few‑step generation, though the benefits vary with the type of alignment and computational budget.

By Moritz Piening, Christian Wald
diffusionsafety
More like this →