Related papers: Hessian Riemannian Flow For Multi-Population Wardr…
In this paper we present a numerical study of some variations of the Hughes model for pedestrian flow under different types of congestion effects. The general model consists of a coupled non-linear PDE system involving an eikonal equation…
In this paper, we introduce a traffic flow model based on a microscopic follow-the-leader model, while enforcing maximal constraints on the density and velocity of the flow. The related macroscopic model can be represented in conservative…
In this paper, we formulate the Load Flow (LF) problem in radial electricity distribution networks as an unconstrained Riemannian optimization problem, consisting of two manifolds, and we consider alternative retractions and initialization…
We study a nonsmooth nonconvex optimization problem defined over nonconvex constraints, where the feasible set is given by the intersection of the closure of an open set and a smooth manifold. By endowing the open set with a Riemannian…
We present new geometric intuition on dynamical versions of regularized optimal transport. We introduce two families of variational problems on Riemannian manifolds which contain analogues of the Schr\"odinger bridge problem and the Yasue…
Macroscopic models of crowd flow incorporating individual pedestrian choices present many analytic and computational challenges. Anisotropic interactions are particularly subtle, both in terms of describing the correct "optimal" direction…
Mean field games (MFGs) model the limit of large populations of strategically interacting agents, yet both forward and inverse problems remain challenging. For the forward problem, a difficulty is to design numerical methods with global…
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…
In this paper, we introduce a new framework for approximately solving flow problems in capacitated, undirected graphs and apply it to provide asymptotically faster algorithms for the maximum $s$-$t$ flow and maximum concurrent…
We develop in this paper a new regularized flow dynamic approach to construct efficient numerical schemes for Wasserstein gradient flows in Lagrangian coordinates. Instead of approximating the Wasserstein distance which needs to solve…
This paper proposes a simplified version of classical models for urban transportation networks, and studies the problem of controlling intersections with the goal of optimizing network-wide congestion. Differently from traditional…
In this paper, we study the stochastic Hamiltonian flow in Wasserstein manifold, the probability density space equipped with $L^2$-Wasserstein metric tensor, via the Wong--Zakai approximation. We begin our investigation by showing that the…
This paper is concerned with a fluidodynamic model for traffic flow. More precisely, we consider a single conservation law, deduced from conservation of the number of cars, defined on a road network that is a collection of roads with…
Unsplittable flow problems cover a wide range of telecommunication and transportation problems and their efficient resolution is key to a number of applications. In this work, we study algorithms that can scale up to large graphs and…
In this paper we provide an algorithm which given any $m$-edge $n$-vertex directed graph with integer capacities at most $U$ computes a maximum $s$-$t$ flow for any vertices $s$ and $t$ in $m^{11/8+o(1)}U^{1/4}$ time with high probability.…
Structurally stable (rough) flows on surfaces have only finitely many singularities and finitely many closed orbits, all of which are hyperbolic, and they have no trajectories joining saddle points. The violation of the last property leads…
Flow Matching enables simulation-free training of generative models on Riemannian manifolds, yet sampling typically still relies on numerically integrating a probability-flow ODE. We propose Riemannian MeanFlow (RMF), extending MeanFlow to…
We consider a general optimal control problem in the setting of gradient flows. Two approximations of the problem are presented, both relying on the variational reformulation of gradient-flow dynamics via the Weighted-Energy-Dissipation…
We develop new variational principles to study stability and equilibrium of axisymmetric flows. We show that there is an infinite number of steady state solutions. We show that these steady states maximize a (non-universal) $H$-function. We…
Real world data often lie on low-dimensional Riemannian manifolds embedded in high-dimensional spaces. This motivates learning degenerate normalizing flows that map between the ambient space and a low-dimensional latent space. However, if…