Minimizing optimal transport for functions with fixed-size nodal sets
Qiang Du, Amir Sagiv

TL;DR
This paper characterizes the functions with fixed nodal points that minimize Wasserstein distance between positive and negative parts, providing sharp bounds and exploring the impact of space geometry on these inequalities.
Contribution
It offers a complete solution for the minimization problem on the line and circle, and reveals how geometry affects the sharpness of uncertainty principle inequalities.
Findings
Sharp constants for uncertainty principle inequalities on line and circle.
Optimal bounds depend on the metric measure space geometry.
Non-sharp bounds on star-graphs due to non-branching assumption violation.
Abstract
Consider the class of zero-mean functions with fixed and norms and exactly nodal points. Which functions minimize , the Wasserstein distance between the measures whose densities are the positive and negative parts? We provide a complete solution to this minimization problem on the line and the circle, which provides sharp constants for previously proven ``uncertainty principle''-type inequalities, i.e., lower bounds on . We further show that, while such inequalities hold in many metric measure spaces, they are no longer sharp when the non-branching assumption is violated; indeed, for metric star-graphs, the optimal lower bound on is not inversely proportional to the size of the nodal set, . Based on similar reductions, we make connections between the analogous problem of minimizing…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMarkov Chains and Monte Carlo Methods · Geometric Analysis and Curvature Flows · Groundwater flow and contamination studies
