DeepAI AI Chat
Log In Sign Up

GOT: An Optimal Transport framework for Graph comparison

by   Hermina Petric Maretic, et al.

We present a novel framework based on optimal transport for the challenging problem of comparing graphs. Specifically, we exploit the probabilistic distribution of smooth graph signals defined with respect to the graph topology. This allows us to derive an explicit expression of the Wasserstein distance between graph signal distributions in terms of the graph Laplacian matrices. This leads to a structurally meaningful measure for comparing graphs, which is able to take into account the global structure of graphs, while most other measures merely observe local changes independently. Our measure is then used for formulating a new graph alignment problem, whose objective is to estimate the permutation that minimizes the distance between two graphs. We further propose an efficient stochastic algorithm based on Bayesian exploration to accommodate for the non-convexity of the graph alignment problem. We finally demonstrate the performance of our novel framework on different tasks like graph alignment, graph classification and graph signal prediction, and we show that our method leads to significant improvement with respect to the-state-of-art algorithms.


Wasserstein-based Graph Alignment

We propose a novel method for comparing non-aligned graphs of different ...

FGOT: Graph Distances based on Filters and Optimal Transport

Graph comparison deals with identifying similarities and dissimilarities...

COPT: Coordinated Optimal Transport on Graphs

We introduce COPT, a novel distance metric between graphs defined via an...

Graph Optimal Transport with Transition Couplings of Random Walks

We present a novel approach to optimal transport between graphs from the...

FiGLearn: Filter and Graph Learning using Optimal Transport

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

A Regularized Wasserstein Framework for Graph Kernels

We propose a learning framework for graph kernels, which is theoreticall...

Robust Attributed Graph Alignment via Joint Structure Learning and Optimal Transport

Graph alignment, which aims at identifying corresponding entities across...