The Gromov-Wasserstein distance between networks and stable network invariants
share
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.
READ FULL TEXT