Optimal Transport in One Dimension: Difference between revisions
No edit summary |
|||
Line 23: | Line 23: | ||
==Quadratic Cost== | ==Quadratic Cost== | ||
'''Theorem:''' Let <math> \mu, \nu </math> be probability measures on <math> \mathbb{R}</math> with cumulative distribution functions <math> F</math> and <math> G</math>, respectively. |
Revision as of 05:52, 12 February 2022
In this article, we explore the optimal transport problem on the real line along with some examples.
Linear Cost Example
For this example, consider the cost function along with a given linear map . Moreover, if let be any transport plan, then by direct computation we see that
which suggests that this result only depends on the marginals of (wherein and are compactly supported probability measures). In fact, in such cases, every transport plan/map is optimal.
Distance Cost Example
Consider the cost function along with probability measures (on ) and . Then, for any we see that , which then immediately puts us back in the linear cost position, so any transport map/plan is also optimal for such costs.
Book Shifting Example
Consider the cost function along with and (where is the one-dimensional Lebesgue measure). A (monotone) transport plan that rearranges to look like is given by and its corresponding cost is
.
Furthermore, notice that the piecewise map given by (for ) and (for ) satisfies , i.e. is a transport map from to ; moreover, the corresponding cost is
and so we conclude that is indeed optimal as well.
Quadratic Cost
Theorem: Let be probability measures on with cumulative distribution functions and , respectively.