Related papers: Stability for the mailing problem
In this paper, we prove that, under precise spectral assumptions, some finite difference approximations of scalar leftgoing transport equations on the positive half-line with numerical boundary conditions are $\ell^1$-stable but…
Large optimal transport problems can be approached via domain decomposition, i.e. by iteratively solving small partial problems independently and in parallel. Convergence to the global minimizers under suitable assumptions has been shown in…
We study the problem of distributed traffic control in the partitioned plane, where the movement of all entities (robots, vehicles, etc.) within each partition (cell) is coupled. Establishing liveness in such systems is challenging, but…
The branched transport problem, a popular recent variant of optimal transport, is a non-convex and non-smooth variational problem on Radon measures. The so-called urban planning problem, on the contrary, is a shape optimization problem that…
We propose a new approach to graph compression by appeal to optimal transport. The transport problem is seeded with prior information about node importance, attributes, and edges in the graph. The transport formulation can be setup for…
A typical problem in optimal design theory is finding an experimental design that is optimal with respect to some criteria in a class of designs. The most popular criteria include the A- and D-criteria. Regular graph designs occur in many…
We study Monge's optimal transportation problem, where the cost is given by optimal control cost. We prove the existence and uniqueness of an optimal map under certain regularity conditions on the Lagrangian, absolute continuity of the…
In this paper we consider an optimal control problem (OCP) for the coupled system of a nonlinear monotone Dirichlet problem with matrix- valued non-smooth controls in coefficients and a nonlinear equation of Ham- merstein type. Since…
Two of the most fundamental distributed symmetry-breaking problems are that of finding a maximal independent set (MIS) and a maximal matching (MM) in a graph. It is a major open question whether these problems can be solved in constant…
We continue and extend previous work on the parameterized complexity analysis of the NP-hard Stable Roommates with Ties and Incomplete Lists problem, thereby strengthening earlier results both on the side of parameterized hardness as well…
We construct a family of steady solutions to the two-dimensional incompressible Euler equation in a general bounded domain, such that the vorticity is supported in two well-separated regions of small diameter and converges to a pair of…
This paper deals with the existence of travelling wave solutions for a general one-dimensional nonlinear Schr\"odinger equation. We construct these solutions by minimizing the energy under the constraint of fixed momentum. We also prove…
Given a sequence $\mathbf{k} := (k_1,\ldots,k_s)$ of natural numbers and a graph $G$, let $F(G;\mathbf{k})$ denote the number of colourings of the edges of $G$ with colours $1,\dots,s$ such that, for every $c \in \{1,\dots,s\}$, the edges…
Optimal transport has emerged as a fundamental methodology with applications spanning multiple research areas in recent years. However, the convergence rate of the empirical estimator to its population counterpart suffers from the curse of…
The quadratically regularized optimal transport problem is empirically known to have sparse solutions: its optimal coupling $\pi_{\varepsilon}$ has sparse support for small regularization parameter $\varepsilon$, in contrast to entropic…
This paper considers the optimal control problem of connecting two periodic trajectories with maximal persistence. A maximally persistent trajectory is close to the periodic type in the sense that the norm of the image of this trajectory…
We show that, on a $2$-dimensional compact manifold, the optimal transport map in the semi-discrete random matching problem is well-approximated in the $L^2$-norm by identity plus the gradient of the solution to the Poisson problem $-\Delta…
The Stable Roommates problems are characterized by the preferences of agents over other agents as roommates. A solution is a partition of the agents into pairs that are acceptable to each other (i.e., they are in the preference lists of…
The structure of networks that provide optimal transport properties has been investigated in a variety of contexts. While many different formulations of this problem have been considered, it is recurrently found that optimal networks are…
Optimal transport on a graph focuses on finding the most efficient way to transfer resources from one distribution to another while considering the graph's structure. This paper introduces a new distributed algorithm that solves the optimal…