DeepAI AI Chat
Log In Sign Up

Wasserstein-based Graph Alignment

by   Hermina Petric Maretic, et al.

We propose a novel method for comparing non-aligned graphs of different sizes, based on the Wasserstein distance between graph signal distributions induced by the respective graph Laplacian matrices. Specifically, we cast a new formulation for the one-to-many graph alignment problem, which aims at matching a node in the smaller graph with one or more nodes in the larger graph. By integrating optimal transport in our graph comparison framework, we generate both a structurally-meaningful graph distance, and a signal transportation plan that models the structure of graph data. The resulting alignment problem is solved with stochastic gradient descent, where we use a novel Dykstra operator to ensure that the solution is a one-to-many (soft) assignment matrix. We demonstrate the performance of our novel framework on graph alignment and graph classification, and we show that our method leads to significant improvements with respect to the state-of-the-art algorithms for each of these tasks.


page 1

page 2

page 3

page 4


GOT: An Optimal Transport framework for Graph comparison

We present a novel framework based on optimal transport for the challeng...

Graph Matching via Optimal Transport

The graph matching problem seeks to find an alignment between the nodes ...

FGOT: Graph Distances based on Filters and Optimal Transport

Graph comparison deals with identifying similarities and dissimilarities...

Graph Optimal Transport for Cross-Domain Alignment

Cross-domain alignment between two sets of entities (e.g., objects in an...

FiGLearn: Filter and Graph Learning using Optimal Transport

In many applications, a dataset can be considered as a set of observed s...

Fast and Provably Convergent Algorithms for Gromov-Wasserstein in Graph Learning

In this paper, we study the design and analysis of a class of efficient ...

Generalized Spectral Clustering via Gromov-Wasserstein Learning

We establish a bridge between spectral clustering and Gromov-Wasserstein...