Related papers: A Dacorogna-Moser approach to flow decomposition a…
We study the problem of transporting one probability measure to another via an autonomous velocity field. We rely on tools from the theory of optimal transport. In one space-dimension, we solve a linear homogeneous functional equation to…
Beckmann's problem in optimal transport minimizes the total squared flux in a continuous transport problem from a source to a target distribution. In this article, the regularity theory for solutions to Beckmann's problem in optimal…
We prove the following nonholonomic version of the classical Moser theorem: given a bracket-generating distribution on a connected compact manifold (possibly with boundary), two volume forms of equal total volume can be isotoped by the flow…
We review two models of optimal transport, where congestion effects during the transport can be possibly taken into account. The first model is Beckmann's one, where the transport activities are modeled by vector fields with given…
We propose a model of optimal parallel transport between vector fields on a connection graph, which consists of a weighted graph along with a map from its edges to an orthogonal group. Inspired by the well-known equivalence of 1-Wasserstein…
In this work, we develop a new framework for dynamic network flow problems based on optimal transport theory. We show that the dynamic multi-commodity minimum-cost network flow problem can be formulated as a multi-marginal optimal transport…
We study a new variant of mathematical prediction-correction model for crowd motion. The prediction phase is handled by a transport equation where the vector field is computed via an eikonal equation $\Vert \nabla\varphi\Vert=f$, with a…
In the classical Monge-Kantorovich problem, the transportation cost only depends on the amount of mass sent from sources to destinations and not on the paths followed by this mass. Thus, it does not allow for congestion effects. Using the…
We consider a class of optimal control problems for measure-valued nonlinear transport equations describing traffic flow problems on networks. The objective isto minimise/maximise macroscopic quantities, such as traffic volume or average…
When the underlying physical network layer in optimal network flow problems is a large graph, the associated optimization problem has a large set of decision variables. In this paper, we discuss how the cycle basis from graph theory can be…
In this article, we present a vector field method for the study of solutions to massless relativistic transport equations. Compared to the methodologie developped by Fajman-Joudioux-Smulevici, we remove the Lorentz boosts of the commutation…
This paper introduces the notions of vector field and flow on a general differentiable stack. Our main theorem states that the flow of a vector field on a compact proper differentiable stack exists and is unique up to a uniquely determined…
The aim of this article is to demonstrate how the vector field method of Klainerman can be adapted to the study of transport equations. After an illustration of the method for the free transport operator, we apply the vector field method to…
We suggest a global perspective on dynamic network flow problems that takes advantage of the similarities to port-Hamiltonian dynamics. Dynamic minimum cost flow problems are formulated as open-loop optimal control problems for general…
The Gromov--Wasserstein problem is a non-convex optimization problem over the polytope of transportation plans between two probability measures supported on two spaces, each equipped with a cost function evaluating similarities between…
This paper is concerned with six variational problems and their mutual connections: The quadratic Monge-Kantorovich optimal transport, the Schr\"odinger problem, Brenier's relaxed model for incompressible fluids, the so-called Br\"odinger…
In this paper, we generalize the minimum flow decomposition problem (MFD) to incorporate uncertain edge capacities and tackle it from the perspective of robust optimization. In the classical flow decomposition problem, a network flow is…
This paper is concerned with the study of a model case of first order Hamilton-Jacobi equations posed on a "junction", that is to say the union of a finite number of half-lines with a unique common point. The main result is a comparison…
We adapt the vector field method of Klainerman to the study of relativistic transport equations. First, we prove robust decay estimates for velocity averages of solutions to the relativistic massive and massless transport equations, without…
We investigate the problem of optimal transport in the so-called Beckmann form, i.e. given two Radon measures on a compact set, we seek an optimal flow field which is a vector valued Radon measure on the same set that describes a flow…