BIRS Workshop Lecture Videos
Combinatorial questions in optimal transport Angel, Omer
Several problems in extremal combinatorics arise from a new generalization of the optimal coupling theorem to multiple random variables: Given a collection of random variables, it is possible to couple all of them so that any two differ with probability comparable to the total-variation distance between them. A typical problem is to maximize various functionals over a selection of an element from each subset of $[n]$ of size $k$.
Item Citations and Data
Attribution-NonCommercial-NoDerivatives 4.0 International