{
  "id": "1901.09400",
  "version": "v1",
  "published": "2019-01-27T16:31:52.000Z",
  "updated": "2019-01-27T16:31:52.000Z",
  "title": "Approximation of Wasserstein distance with Transshipment",
  "authors": [
    "Nicolas Papadakis"
  ],
  "categories": [
    "math.NA",
    "stat.CO"
  ],
  "abstract": "An algorithm for approximating the p-Wasserstein distance between histograms defined on unstructured discrete grids is presented. It is based on the computation of a barycenter constrained to be supported on a low dimensional subspace, which corresponds to a transshipment problem. A multi-scale strategy is also considered. The method provides sparse transport matrices and can be applied to large scale and non structured data.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2019-01-27T16:31:52.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "approximation",
      "low dimensional subspace",
      "sparse transport matrices",
      "non structured data",
      "p-wasserstein distance"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}