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.
arXiv:2605. 24395v2 Announce Type: replace Abstract: Alignment plays a fundamental role in many machine learning problems, such as multi-network analysis, multimodal learning, and point cloud registration.
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.
arXiv:2608.29635v1 Announce Type: new Abstract: We study unsupervised hypergraph alignment, where the goal is to infer node correspondences between two hypergraphs using only structural information,...
arXiv:2609.15437v1 Announce Type: cross Abstract: End-to-end Supervised Graph Prediction (SGP) requires a permutation-invariant loss to compare predicted and target graphs with arbitrary node orderin...
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.
arXiv:2506.02825v3 Announce Type: replace-cross Abstract: We present the OmniMatch algorithm for seeded multiple graph matching. In the setting of $d$-dimensional Random Dot Product Graphs (RDPG), we...
arXiv:2505. 13087v2 Announce Type: replace-cross Abstract: We propose a novel benchmarking methodology for graph neural networks (GNNs) based on the graph alignment problem, a combinatorial optimization task that generalizes graph isomorphism by aligning two unlabeled graphs to maximize overlapping edges.
arXiv:2203. 04711v2 Announce Type: replace Abstract: We present a framework for embedding graph structured data into a vector space, taking into account node features and topology of a graph into the optimal transport (OT) problem.
arXiv:2607. 24338v1 Announce Type: new Abstract: Unsupervised graph representation learning aims to derive meaningful node embeddings by capturing both structural and attribute information without relying on labeled data.
arXiv:2606. 16379v1 Announce Type: new Abstract: Evaluating representation similarity is fundamental to representation learning.
arXiv:2608. 02321v1 Announce Type: cross Abstract: Graph functional dependencies (GFD) are a recently-developed concept aimed at capturing both topological structures in graphs and functional dependencies between attributes.
arXiv:2602.08519v2 Announce Type: replace Abstract: Attributed Graph Clustering (AGC) is a fundamental unsupervised task that integrates structural topology and node attributes to uncover latent patt...