Related papers: The max flow/min cut theorem for currents and lami…
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^{4/3+o(1)}U^{1/3}$ time. This improves upon the…
In this paper, we consider steady Euler flows in two-dimensional bounded annuli, as well as in exterior circular domains, in punctured disks and in the punctured plane. We always assume rigid wall boundary conditions. We prove that, if the…
The continuous min flow-max cut principle is used to reformulate the 'complexity=volume' conjecture using Lorentzian flows -- divergenceless norm-bounded timelike vector fields whose minimum flux through a boundary subregion is equal to the…
We show that the standard discrete update rule of transformer layers can be naturally interpreted as a forward Euler discretization of a continuous dynamical system. Our Transformer Flow Approximation Theorem demonstrates that, under…
Given a flow network with variable suppliers and fixed consumers, the minimax flow problem consists in minimizing the maximum flow between nodes, subject to flow conservation and capacity constraints. We solve this problem over acyclic…
Advances in the image-based diagnostics of complex biological and manufacturing processes have brought unsupervised image segmentation to the forefront of enabling automated, on the fly decision making. However, most existing unsupervised…
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.…
The classical Lorenz flow, and any flow which is close to it in the $C^2$-topology, satisfies a Central Limit Theorem (CLT). We prove that the variance in the CLT varies continuously.
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 the present paper we obtain a new homological version of the implicit function theorem and some versions of the Darboux theorem. Such results are proved for continuous maps on topological manifolds. As a consequence, some versions of…
Teichm\"uller's classical mapping problem for plane domains concerns finding a lower bound for the maximal dilatation of a quasiconformal homeomorphism which holds the boundary pointwise fixed, maps the domain onto itself, and maps a given…
The \emph{vitality} of an arc/node of a graph with respect to the maximum flow between two fixed nodes $s$ and $t$ is defined as the reduction of the maximum flow caused by the removal of that arc/node. In this paper we address the issue of…
We consider the problem of finding the value of a maximum flow over time in a network with uniform edge lengths where the edge capacities change at specific time instants. To solve this problem, we show how to construct a condensed version…
This article is a first step towards the understanding of the dynamics of the horocycle flow on foliated manifolds by hyperbolic surfaces. This is motivated by a question formulated by M. Martinez and A. Verjovsky on the minimality of this…
We discuss a short-time existence theorem of solutions to the initial value problem for a fourth-order dispersive flow for curves parametrized by the real line into a compact K\"ahler manifold. Our equations geometrically generalize a…
In this paper, we consider steady Euler flows in a planar bounded domain in which the vorticity is sharply concentrated in a finite number of disjoint regions of small diameter. Such flows are closely related to the point vortex model and…
We study the maximum flow problem in directed H-minor-free graphs where H can be drawn in the plane with one crossing. If a structural decomposition of the graph as a clique-sum of planar graphs and graphs of constant complexity is given,…
We consider the graphical mean curvature flow of maps ${\bf f}:\mathbb{R}^m\to\mathbb{R}^n$, $m\ge 2$, and derive estimates on the growth rates of the evolved graphs, based on a new version of the maximum principle for properly immersed…
In the realm of light logics deriving from linear logic, a number of variants of exponential rules have been investigated. The profusion of such proof systems induces the need for cut-elimination theorems for each logic, the proof of which…
The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weight sum of the cut edges. Here, we introduce a linear-time algorithm to compute near-minimum cuts. Our…