2000 character limit reached
Introduction to Optimal Transport Theory (1009.3856v1)
Published 20 Sep 2010 in math.CA, math.AP, math.DG, and math.PR
Abstract: These notes constitute a sort of Crash Course in Optimal Transport Theory. The different features of the problem of Monge-Kantorovitch are treated, starting from convex duality issues. The main properties of space of probability measures endowed with the distances $W_p$ induced by optimal transport are detailed. The key tools to put in relation optimal transport and PDEs are provided.
Sponsor
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.