AI Chat AI Image Generator AI Video Text to Speech

The Gromov-Wasserstein distance between networks and stable network invariants

08/13/2018

∙

by Samir Chowdhury, et al.

∙

∙

We define a metric---the Network Gromov-Wasserstein distance---on weighted, directed networks that is sensitive to the presence of outliers. In addition to proving its theoretical properties, we supply easily computable network invariants that approximate this distance by means of lower bounds.

Samir Chowdhury
10 publications
Facundo Mémoli
37 publications

page 1

page 2

page 3

page 4

research

∙ 08/16/2017

Distances and Isomorphism between Networks and the Stability of Network Invariants

We develop the theoretical foundations of a network distance that has re...

0 Samir Chowdhury, et al. ∙

research

∙ 06/18/2020

When OT meets MoM: Robust estimation of Wasserstein Distance

Issued from Optimal Transport, the Wasserstein distance has gained impor...

0 Guillaume Staerman, et al. ∙

research

∙ 02/27/2019

An exponential lower bound for the degrees of invariants of cubic forms and tensor actions

Using the Grosshans Principle, we develop a method for proving lower bou...

0 Harm Derksen, et al. ∙

research

∙ 05/27/2019

Invariants and Inequivalence of Linear Rank-Metric Codes

We show that the sequence of dimensions of the linear spaces, generated ...

0 Alessandro Neri, et al. ∙

research

∙ 05/30/2017

The Cramer Distance as a Solution to Biased Wasserstein Gradients

The Wasserstein probability metric has received much attention from the ...

0 Marc G. Bellemare, et al. ∙

research

∙ 02/05/2022

Weisfeiler-Lehman meets Gromov-Wasserstein

The Weisfeiler-Lehman (WL) test is a classical procedure for graph isomo...

0 Samantha Chen, et al. ∙

research

∙ 06/09/2019

A general solver to the elliptical mixture model through an approximate Wasserstein manifold

This paper studies the problem of estimation for general finite mixture ...

0 Shengxi Li, et al. ∙