Related papers: A Dacorogna-Moser approach to flow decomposition a…
The classical approach to visualizing a flow, in terms of its streamlines, motivates a topological/soft-analytic argument for constrained variational equations. In its full generality, that argument provides an explicit formula for…
Classic optimal transport theory is formulated through minimizing the expected transport cost between two given distributions. We propose the framework of distorted optimal transport by minimizing a distorted expected cost, which is the…
We combine Gromov's amenable localization technique with the Poincar\'{e} duality to study the traversally generic vector flows on smooth compact manifolds $X$ with boundary. Such flows generate well-understood stratifications of $X$ by the…
Topological abstractions offer a method to summarize the behavior of vector fields but computing them robustly can be challenging due to numerical precision issues. One alternative is to represent the vector field using a discrete approach,…
Co-moving volumes and Reynolds transport theorem along a fluid flow are fundamental tools to derive balance laws in fluid mechanics, where the classical theory on flow maps of ODEs associated to smooth vector fields plays a central role.…
We address the problem of optimal transport with a quadratic cost functional and a constraint on the flux through a constriction along the path. The constriction, conceptually represented by a toll station, limits the flow rate across. We…
The well-posedness of a phase-field approximation to the Willmore flow with volume constraint is established. The existence proof relies on the underlying gradient flow structure of the problem: the time discrete approximation is solved by…
We completely characterise the optimal solutions for the three-marginal optimal transport problem - introduced in [K. Bolbotowski, G. Bouchitt\'e, Kantorovich-Rubinstein duality theory for the Hessian, 2024, preprint], and whose relaxation…
Torque-driven microscale swimming robots, or microrotors, hold significant potential in biomedical applications such as targeted drug delivery, minimally invasive surgery, and micromanipulation. This paper addresses the challenge of…
In the papers (Shvidler, 1985 and 1993, and Shvidler and Karasaki, 1999, 2001, 2005, and 2008) we developed an approach for finding the exactly averaged equations of flow and transport in porous media. We studied for steady state flow with…
In this paper, we address the problem of modeling the traffic flow of a heritage city whose streets are represented by a network. We consider a mean field approach where the standard forward backward system of equations is also intertwined…
Minimum flow decomposition (MFD) is the NP-hard problem of finding a smallest decomposition of a network flow/circulation $X$ on a directed graph $G$ into weighted source-to-sink paths whose superposition equals $X$. We show that, for…
In the setting of optimal transport with $N\ge 2$ marginals, a necessary condition for transport plans to be optimal is that they are $c$-cyclically monotone. For $N=2$ there exist several proofs that in very general settings $c$-cyclical…
The fully compressible semi-geostrophic system is widely used in the modelling of large-scale atmospheric flows. In this paper, we prove rigorously the existence of weak Lagrangian solutions of this system, formulated in the original…
Flows over time generalize classical network flows by introducing a notion of time. Each arc is equipped with a transit time that specifies how long flow takes to traverse it, while flow rates may vary over time within the given edge…
We consider here probabilistic models of transportation flows. The main goal of this introduction is rather not to present various techniques for problem solving but to present some intuition to invent adequate and natural models having…
Optimal mass transport, also known as the earth mover's problem, is an optimization problem with important applications in various disciplines, including economics, probability theory, fluid dynamics, cosmology and geophysics to cite a few.…
The classical Okamura-Seymour theorem states that for an edge-capacitated, multi-commodity flow instance in which all terminals lie on a single face of a planar graph, there exists a feasible concurrent flow if and only if the cut…
Deterministic equilibrium flows in transport networks can be investigated by means of Markov's processes defined on the dual graph representations of the network. Sustained movement patterns are generated by a subset of automorphisms of the…
The Robert-Sommeria-Miller equilibrium statistical mechanics predicts the final organization of two dimensional flows. This powerful theory is difficult to handle practically, due to the complexity associated with an infinite number of…