A transport plan is a coupling of probability distributions μ,ν, that is, a probability measure on the product space with those marginal distributions. Unlike a transport map, it need not be concentrated on the graph of a function.
Ancestors (6)
- Kantorovich optimal transport problem
- Optimal transport
- Mathematical optimization
- Area of mathematics
- Mathematics
- Home
Incoming links (41)
- Brenier theorem
- c-cyclical monotonicity
- Confinement energy
- Displacement interpolation
- Fenchel–Young gap
- Finite-cost optimal transport converse
- Interaction energy
- Kantorovich duality by positive extension
- Kantorovich duality theorem
- Kantorovich optimal transport problem
- Kantorovich potential
- Knott–Smith optimality criterion
- Monotone rearrangement
- Optimal transport
- Past exam of the mathematics course of the University of Cambridge / 2013 / iii / Paper 7 / 4 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2014 / iii / Paper 8 / 3 / a / Solution
- Past exam of the mathematics course of the University of Cambridge / 2014 / iii / Paper 8 / 3 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2019 / iii / Paper 348 / 1 / a / Solution
- Past exam of the mathematics course of the University of Cambridge / 2019 / iii / Paper 348 / 1 / b / Solution
- Past exam of the mathematics course of the University of Cambridge / 2019 / iii / Paper 348 / 1 / c / Solution
- Past exam of the mathematics course of the University of Cambridge / 2019 / iii / Paper 348 / 2 / c / Solution
- Past exam of the mathematics course of the University of Cambridge / 2019 / iii / Paper 348 / 2 / d / Solution
- Past exam of the mathematics course of the University of Cambridge / 2019 / iii / Paper 348 / 3 / b / Solution
- Past exam of the mathematics course of the University of Cambridge / 2019 / iii / Paper 348 / 3 / d / Solution
- Past exam of the mathematics course of the University of Cambridge / 2019 / iii / Paper 348 / 4 / a / Solution
- Past exam of the mathematics course of the University of Cambridge / 2019 / iii / Paper 348 / 4 / b / Solution
- Past exam of the mathematics course of the University of Cambridge / 2019 / iii / Paper 348 / 4 / c / Solution
- Past exam of the mathematics course of the University of Cambridge / 2019 / iii / Paper 348 / 4 / d / Solution
- Past exam of the mathematics course of the University of Cambridge / 2019 / iii / Paper 348 / 5 / a / Solution
- Past exam of the mathematics course of the University of Cambridge / 2019 / iii / Paper 348 / 5 / b / Solution
- Past exam of the mathematics course of the University of Cambridge / 2019 / iii / Paper 348 / 5 / c / Solution
- Past exam of the mathematics course of the University of Cambridge / 2019 / iii / Paper 348 / 5 / d / Solution
- Past exam of the optimal transport and partial differential equations course of the University of Oxford / 2025 / 1 / a / Solution
- Past exam of the optimal transport and partial differential equations course of the University of Oxford / 2025 / 1 / d / Solution
- Past exam of the optimal transport and partial differential equations course of the University of Oxford / 2025 / 2 / a / Solution
- Past exam of the optimal transport and partial differential equations course of the University of Oxford / 2025 / 2 / b / Solution
- p-Wasserstein distance
- Strong c-monotonicity
- Transport cost function
- Transport map
- Variance identity for independent copies
Discussion (0)
New discussionThere are no discussions about this article yet.
Articles by others on the same topic (0)
There are currently no matching articles.