Related papers: Stability of optimal traffic plans in the irrigati…
We consider maps $T$ solving the optimal transport problem with a cost $c(x-y)$ modeled on the $p$-cost. For H\"older continuous marginals, we prove a $C^{1,\alpha}$-partial regularity result for $T $in the set $\{|T(x)-x|>0\}$.
We investigate the optimal transport problem between probability measures when the underlying cost function is understood to satisfy a least action principle, also known as a Lagrangian cost. These generalizations are useful when connecting…
We consider two different variational models of transport networks, the so-called branched transport problem and the urban planning problem. Based on a novel relation to Mumford-Shah image inpainting and techniques developed in that field,…
We investigate the 1D version of the notable Bressan's mixing conjecture, and introduce various formulation in the classical optimal transport setting, the branched optimal transport setting and a combinatorial optimization. In the discrete…
The paper is devoted to the study of a stabilization problem for the 2D incompressible Euler system in an infinite strip with boundary controls. We show that for any stationary solution (c, 0) of the Euler system there is a control which is…
We provide a geometric interpretation of the well known A3w condition for regularity of optimal transport maps.
We analyze a family of degenerate parabolic equations with linear growth Lagrangian having the form $u_t=\div (\varphi(u)\psi(\nabla u/u))$. Here $|\psi|\le 1$ and saturates at infinity. We present a simple and natural set of assumptions on…
Optimizing passengers routes is crucial to design efficient transportation networks. Recent results show that optimal transport provides an efficient alternative to standard optimization methods. However, it is not yet clear if this…
We discuss the mathematical modeling and numerical discretization of transport problems on one-dimensional networks. Suitable coupling conditions are derived that guarantee conservation of mass across network junctions and dissipation of a…
This paper explores the controllability and state tracking of ensembles from the perspective of optimal transport theory. Ensembles, characterized as collections of systems evolving under the same dynamics but with varying initial…
We establish the validity of asymptotic limits for the general transportation problem between random i.i.d. points and their common distribution, with respect to the squared Euclidean distance cost, in any dimension larger than three.…
In this work we consider an optimal transport problem with coefficients in a normed Abelian group $G$, and extract a purely intrinsic condition on $G$ that guarantees that the optimal transport (or the corresponding minimum filling) is not…
A simple scheme for incompressible, constant density flows is presented, which avoids odd-even decoupling for the Laplacian on a collocated grids. Energy stability is implied by maintaining strict energy conservation. Momentum is conserved.…
We review matrix methods as applied to tracer transport. Because tracer transport is linear, matrix methods are an ideal fit for the problem. A gridded, Eulerian tracer simulation can be approximated as a system of linear ordinary…
We introduce a model of infinite horizon linear dynamic optimization with linear constraints and obtain results concerning feasibility of trajectories and optimal solutions necessarily satisfying conditions that resemble the Euler condition…
This paper focuses on the proof of the stability of entropy weak solutions of a nonlocal balance law modeling vehicular traffic flow on a road with on- and off-ramps. The stability is obtained with respect to a kernel function in the source…
It was shown in \cite{bloch2000optimal} that an optimal control formulation for incompressible ideal fluid flow yields Euler's equations. In this paper, we consider a variational obstacle-avoidance formulation for incompressible ideal flows…
This paper deals with a variant of the optimal transportation problem. Given f $\in$ L 1 (R d , [0, 1]) and a cost function c $\in$ C(R d x R d) of the form c(x, y) = k(y -- x), we minimise $\int$ c d$\gamma$ among transport plans $\gamma$…
Advective transport of scalar quantities through surfaces is of fundamental importance in many scientific applications. From the Eulerian perspective of the surface it can be quantified by the well-known integral of the flux density. The…
In this paper we study the following extremal graph theoretic problem: Given an undirected Eulerian graph $G$, which Eulerian orientation minimizes or maximizes the number of arborescences? We solve the minimization for the complete graph…