9 citations · 9 across the 5 of their papers we have counts for
5 papers
Sharp upper bound for a branched transport problem coming from Ginzburg-Landau models
Alessandro Cosenza, Michael Goldman, Felix Otto
We consider a branched transport type problem with weakly imposed boundary conditions, which can be seen as a blown-up version of a reduced model for type-I superconductors in the…
From Combinatorics to Partial Differential Equations
Francesco Mattesini, Felix Otto
The optimal matching of point clouds in is a combinatorial problem; applications in statistics motivate to consider random point clouds, like the Poisson point proce…
Almost sharp rates of convergence for the average cost and displacement in the optimal matching problem
Michael Goldman, Martin Huesmann, Felix Otto
In this note we prove estimates for the average cost in the quadratic optimal transport problem on the two-dimensional flat torus which are optimal up to a double logarithm. We als…
There is no stationary -cyclically monotone Poisson matching in 2D
Martin Huesmann, Francesco Mattesini, Felix Otto
We show that for there is no -cyclically monotone stationary matching of two independent Poisson processes in dimension . The proof combines the -harmonic approxim…
A variational proof of partial regularity for optimal transportation maps
Michael Goldman, F Otto
We provide a new proof of the known partial regularity result for the optimal transportation map (Brenier map) between two sets. Contrary to the existing regularity theory for the…