Related papers: A simple phase-field approximation of the Steiner …
We investigate energy transport in several two-level atom or spin-1/2 models by a direct coupling to heat baths of different temperatures. The analysis is carried out on the basis of a recently derived quantum master equation which…
We study the regularity properties of the minimisers of entropic optimal transport providing a natural analogue of the $\varepsilon$-regularity theory of quadratic optimal transport in the entropic setting. More precisely, we show that if…
We propose an entropic approximation approach for optimal transportation problems with a supremal cost. We establish $\Gamma$-convergence for suitably chosen parameters for the entropic penalization and that this procedure selects…
It is widely acknowledged that the convergence proof of the error in the $l_{\infty}$ norm of the high-order finite difference method (FDM) and finite element method (FEM) in 2D is challenging. In this paper, we derive the sixth-order…
The problem of non-linear transport near a quantum phase transition is solved within the Landau theory for the dissipative insulator-superconductor phase transition in two dimensions. Using the non-equilibrium Schwinger round-trip Green…
We show continuity of the martingale optimal transport optimisation problem as a functional of its marginals. This is achieved via an estimate on the projection in the nested/causal Wasserstein distance of an arbitrary coupling on to the…
We give a characterization of optimal transport plans for a variant of the usual quadratic transport cost introduced in [33]. Optimal plans are composition of a deterministic transport given by the gradient of a continuously differentiable…
In the optimal partial transport problem, one is asked to transport a fraction $0<m \leq \min\{||f||_{L^1}, ||g||_{L^1}\}$ of the mass of $f=f \chi_\Omega$ onto $g=g\chi_\Lambda$ while minimizing a transportation cost. If $f$ and $g$ are…
In this paper we consider the Euclidean Steiner tree problem and, more generally, (single sink) Gilbert--Steiner problems as prototypical examples of variational problems involving 1-dimensional connected sets in $\mathbb{R}^n$. Following…
We construct Two-Point Flux Approximation (TPFA) finite volume schemes to solve the quadratic optimal transport problem in its dynamic form, namely the problem originally introduced by Benamou and Brenier. We show numerically that these…
A quadratic optimal transport metric on the set of probability measure over $\R^2$ is introduced. The quadratic cost is given by the euclidean norm on $\R^2$ associated to some well chosen symmetric positive matrix, which makes the metric…
We investigate the minimum cost of a wide class of combinatorial optimization problems over random bipartite geometric graphs in $\mathbb{R}^d$ where the edge cost between two points is given by a $p$-th power of their Euclidean distance.…
The Steiner tree problem is one of the classic and most fundamental $\mathcal{NP}$-hard problems: given an arbitrary weighted graph, seek a minimum-cost tree spanning a given subset of the vertices (terminals). Byrka \emph{et al}. proposed…
The Gilbert-Steiner problem is a mass transportation problem, where the cost of the transportation depends on the network used to move the mass and it is proportional to a certain power of the "flow". In this paper, we introduce a new…
In the geometric transportation problem, we are given a collection of points $P$ in $d$-dimensional Euclidean space, and each point is given a supply of $\mu(p)$ units of mass, where $\mu(p)$ could be a positive or a negative integer, and…
Given two sets of points in the plane, $P$ of $n$ terminals and $S$ of $m$ Steiner points, a Steiner tree of $P$ is a tree spanning all points of $P$ and some (or none or all) points of $S$. A Steiner tree with length of longest edge…
We study the convergence of the transport plans $\gamma_\epsilon$ towards $\gamma_0$ as well as the cost of the entropy-regularized optimal transport $(c,\gamma_\epsilon)$ towards $(c,\gamma_0)$ as the regularization parameter $\epsilon$…
This article generalizes the study of branched/ramified optimal transportation to those with capacity constraints. Each admissible transport network studied here is represented by a transport multi-path between measures, with a capacity…
We study a generalization of the Steiner tree problem, where we are given a weighted network $G$ together with a collection of $k$ subsets of its vertices and a root $r$. We wish to construct a minimum cost network such that the network…
Weak optimal transport generalizes the classical theory of optimal transportation to nonlinear cost functions and covers a range of problems that lie beyond the traditional theory - including entropic transport, martingale transport, and…