Intrinsic Sparsity of Kantorovich Solutions
Abstract
Let $X,Y$ be two finite sets of points having $\#X = m$ and $\#Y = n$ points with $\mu = (1/m) \sum_{i=1}^{m} \delta_{x_i}$ and $\nu = (1/n) \sum_{j=1}^{n} \delta_{y_j}$ being the associated uniform probability measures. A result of Birkhoff implies that if $m = n$, then the Kantorovich problem has a solution which also solves the Monge problem: optimal transport can be realized with a bijection $\pi: X \rightarrow Y$. This is impossible when $m \neq n$. We observe that when $m \neq n$, there exists a solution of the Kantorovich problem such that the mass of each point in $X$ is moved to at most $n/\gcd(m,n)$ different points in $Y$ and that, conversely, each point in $Y$ receives mass from at most $m/\gcd(m,n)$ points in $X$.
 Publication:

arXiv eprints
 Pub Date:
 May 2022
 DOI:
 10.48550/arXiv.2205.03213
 arXiv:
 arXiv:2205.03213
 Bibcode:
 2022arXiv220503213H
 Keywords:

 Mathematics  Optimization and Control