Related papers: A Dacorogna-Moser approach to flow decomposition a…
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…
The classical Kantorovich-Rubinstein duality theorem establishes a significant connection between Monge optimal transport and maximization of a linear form on the set of 1-Lipschitz functions. This result has been widely used in various…
This paper contains two contributions in the study of optimal transport on metric graphs. Firstly, we prove a Benamou-Brenier formula for the Wasserstein distance, which establishes the equivalence of static and dynamical optimal transport.…
Existence and uniqueness of global in time measure solution for the multidimensional aggregation equation is analyzed. Such a system can be written as a continuity equation with a velocity field computed through a self-consistent…
We investigate a matrix dynamical system related to optimal mass transport in the linear category, namely, the problem of finding an optimal invertible matrix by which two covariance matrices are congruent. We first review the differential…
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…
As a common generalization of previously solved optimization problems concerning bipartite stable matchings, we describe a strongly polynomial network flow based algorithm for computing $\ell$ disjoint stable matchings with minimum total…
We give necessary and sufficient conditions for the existence of smooth Lyapunov 1-forms for the flow of a smooth vector field in terms of the behavior of certain locally finite invariant measures. The main statement generalizes a result of…
The manipulation of a collection of fluid particles in a low Reynolds number environment has several important applications. As we demonstrate in this paper, this manipulation problem is related to the scientific question of how fluid flow…
We show that solutions to certain higher-order intrinsic geometric flows on a compact manifold, including some flows generated by the ambient obstruction tensor, are unique. With the goal of providing a complete self-contained proof,…
We show that vector fields $b$ whose spatial derivative $D_xb$ satisfies a Orlicz summability condition have a spatially continuous representative and are well-posed. For the case of sub-exponential summability, their flows satisfy a Lusin…
We combine the work of Garg and Konemann, and Fleischer with ideas from dynamic graph algorithms to obtain faster (1-eps)-approximation schemes for various versions of the multicommodity flow problem. In particular, if eps is moderately…
In this paper we study obstacles immerged in a Stokes flow with Navier boundary conditions. We prove the existence and regularity of an obstacle with minimal drag, among all shapes of prescribed volume and controlled surface area, taking…
Starting from the recently proposed energy-based deviational formulation for solving the Boltzmann equation [J.-P. Peraud and N. G. Hadjiconstantinou, Phys. Rev. B 84, 2011], which provides significant computational speedup compared to…
Using extrapolation theory, we develop a new framework to prove the uniqueness of solutions for transport equations. We apply our methodology to unify and extend the classical results of Yudovich and Vishik for 2D Euler equations. In…
Minimum flow decomposition (MFD) -- the problem of finding a minimum set of weighted source-to-sink paths that perfectly decomposes a flow -- is a classical problem in Computer Science, and variants of it are powerful models in different…
We consider the problem of multicommodity flows in planar graphs. Okamura and Seymour showed that if all the demands are incident on one face, then the cut-condition is sufficient for routing demands. We consider the following…
We prove that $c$-cyclically monotone transport plans $\pi$ optimize the Monge-Kantorovich transportation problem under an additional measurability condition. This measurability condition is always satisfied for finitely valued, lower…
Inspired by work of Besson-Courtois-Gallot, we construct a flow called the natural flow on a non-positively curved Riemannian manifold $M$. As with the natural map, the $k$-Jacobian of the natural flow is directly related to the critical…
The Monge-Kantorovich transportation problem involves optimizing with respect to a given a cost function. Uniqueness is a fundamental open question about which little is known when the cost function is smooth and the landscapes containing…