2000 character limit reached
On Optimal Transport Maps Between 1 /d-Concave Densities
Published 8 Apr 2024 in math.AP | (2404.05456v1)
Abstract: In this paper, we extend the scope of Caffarelli's contraction theorem, which provides a measure of the Lipschitz constant for optimal transport maps between log-concave probability densities in $\Rd$. Our focus is on a broader category of densities, specifically those that are $\nicefrac{1}{d}$-concave and can be represented as $V{-d}$, where $V$ is convex. By setting appropriate conditions, we derive linear or sublinear limitations for the optimal transport map. This leads us to a comprehensive Lipschitz estimate that aligns with the principles established in Caffarelli's theorem.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.