Related papers: On the analyticity of the flow map for the AHT equ…
In this note, we will consider the question of local equivalence of analytic functions which fix the origin and are tangent to the identity, as well as the question of flows of analytic vector fields. All mappings and equivalences are…
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…
Adapted optimal transport (AOT) problems are optimal transport problems for distributions of a time series where couplings are constrained to have a temporal causal structure. In this paper, we develop computational tools for solving AOT…
We establish a connection between Optimal Transport Theory and classical Convection Theory for geophysical flows. Our starting point is the model designed few years ago by Angenent, Haker and Tannenbaum to solve some Optimal Transport…
Modern transportation network modeling increasingly involves the integration of diverse methodologies including sensor-based forecasting, reinforcement learning, classical flow optimization, and demand modeling that have traditionally been…
In this article we provide a method to generate the trade-off between delivery time and fluence map matching quality for volumetric modulated arc therapy (VMAT). At the heart of our method lies a mathematical programming model that, for a…
By extending the method developed in our recent paper \cite{LM} we present the AQFT framework in terms of von Neumann algebras. In particular, this approach allows for a locally covariant categorical description of AQFT which moreover…
The flow equation approach investigated by Wegner et al. is applied to an unbounded Hamiltonian system with a generalization. We show that a well-known quantized complex energy eigenvalues which is related to decay widths can be given with…
We consider a linear transport equation on the edges of a network with time-varying coefficients. Using methods for non-autonomous abstract Cauchy problems, we obtain well-posedness of the problem and describe the asymptotic profile of the…
A new proof is given of the fact that the particle trajectories of the ideal incompressible fluid are analytic curves, though the solutions of the Euler equations may have a finite regularity. This is a consequence of a general fact that…
Rectified flow (Liu et al., 2022; Liu, 2022; Wu et al., 2023) is a method for defining a transport map between two distributions, and enjoys popularity in machine learning, although theoretical results supporting the validity of these…
The All-Pairs Max-Flow problem has gained significant popularity in the last two decades, and many results are known regarding its fine-grained complexity. Despite this, wide gaps remain in our understanding of the time complexity for…
We consider the 1-harmonic flow of maps from a bounded domain into a submanifold of a Euclidean space, i.e. the gradient flow of the total variation functional restricted to maps taking values in the manifold. We restrict ourselves to…
Quantifying differences between flow fields is a key challenge in fluid mechanics, particularly when evaluating the effectiveness of flow control. Traditional vector metrics, such as the Euclidean distance, provide straightforward pointwise…
The conformal heat flow of harmonic maps is a system of evolution equations combined with harmonic map flow with metric evolution in conformal direction. It is known that global weak solution of the flow exists and smooth except at mostly…
Traffic prediction is a fundamental task in many real applications, which aims to predict the future traffic volume in any region of a city. In essence, traffic volume in a region is the aggregation of traffic flows from/to the region.…
Flows over time have received substantial attention from both an optimization and (more recently) a game-theoretic perspective. In this model, each arc has an associated delay for traversing the arc, and a bound on the rate of flow entering…
We consider the problem of transporting \nota{one probability measure into another through} the flow of a given driftless control-affine system. Under suitable regularity conditions, the controllability of the system by means of open-loop…
We investigate the problem of efficiently computing optimal transport (OT) distances, which is equivalent to the node-capacitated minimum cost maximum flow problem in a bipartite graph. We compare runtimes in computing OT distances on data…
We study the Allen-Cahn equation with respect to a transport term in a bounded domain. We prove that the limit interface is the mean curvature flow with the transport term, given the condition that the energy is uniformly bounded with…