8 papers
-transport with discrete target as a combinatorial matching problem
Mohit Bansil, Jun Kitagawa
In this short note, we show that given a cost function , any coupling of two probability measures where the second is a discrete measure can be associated to a certain bipar…
Computational Semi-Discrete Optimal Transport with General Storage Fees
Mohit Bansil
We propose and analyze a modified damped Newton algorithm to solve the semi-discrete optimal transport with storage fees. We prove global linear convergence for a wide range of sto…
Quantitative stability in the geometry of semi-discrete optimal transport
Mohit Bansil, Jun Kitagawa
We show quantitative stability results for the geometric "cells" arising in semi-discrete optimal transport problems. Our results show two types of stability, the first is stabilit…
Two Stage Algorithm for Semi-Discrete Optimal Transport on Disconnected Domains
Mohit Bansil
In this paper we present a two-stage algorithm to solve the semi-discrete Optimal Transport Problem in the case where the support of the source measure is disconnected. We establis…
An Analog of the Weyl Law for the Kohn Laplacian on Spheres
Mohit Bansil, Yunus E. Zeytuncu
We present an explicit formula for the leading coefficient in the asymptotic expansion of the eigenvalue counting function of the Kohn Laplacian on the unit sphere $\mathbb{S}^{2n-…
A Newton algorithm for semi-discrete optimal transport with storage fees
Mohit Bansil, Jun Kitagawa
We introduce and prove convergence of a damped Newton algorithm to approximate solutions of the semi-discrete optimal transport problem with storage fees, corresponding to a proble…