Related papers: A node-capacitated Okamura-Seymour theorem
We present an extremal result for the class of graphs G which (together with some specified sets of input and output vertices, I and O) have a certain "flow" property introduced by Danos and Kashefi for the one-way measurement model of…
Let $G = (VG, AG)$ be a directed graph with a set $S \subseteq VG$ of terminals and nonnegative integer arc capacities $c$. A feasible multiflow is a nonnegative real function $F(P)$ of "flows" on paths $P$ connecting distinct terminals…
We consider sufficient conditions for the existence of $k$-th powers of Hamiltonian cycles in $n$-vertex graphs $G$ with minimum degree $\mu n$ for arbitrarily small $\mu>0$. About 20 years ago Koml\'os, Sark\"ozy, and Szemer\'edi resolved…
We consider the problem of determining the class of continuous-time dynamical systems that can be globally linearized in the sense of admitting an embedding into a linear system on a higher-dimensional Euclidean space. We solve this problem…
We prove that a signed graph admits a nowhere-zero $8$-flow provided that it is flow-admissible and the underlying graph admits a nowhere-zero $4$-flow. When combined with the 4-color theorem, this implies that every flow-admissible…
We prove the Multiplicity One Conjecture for mean curvature flows of surfaces in $\mathbb{R}^3$. Specifically, we show that any blow-up limit of such mean curvature flows has multiplicity one. This has several applications. First, combining…
Given a large edge-capacitated network $G$ and a subset of $k$ vertices called terminals, an (exact) flow sparsifier is a small network $G'$ that preserves (exactly) all multicommodity flows that can be routed between the terminals. Flow…
A limit theorem for a sequence of diffusion processes on graphs is proved in a case when vary both parameters of the processes (the drift and diffusion coefficients on every edge and the asymmetry coefficients in every vertex), and…
We improve on random sampling techniques for approximately solving problems that involve cuts and flows in graphs. We give a near-linear-time construction that transforms any graph on n vertices into an O(n\log n)-edge graph on the same…
We introduce temporal flows on temporal networks, i.e., networks the links of which exist only at certain moments of time. Such networks are ephemeral in the sense that no link exists after some time. Our flow model is new and differs from…
Very little is yet known regarding the Willmore flow of surfaces with Dirichlet boundary conditions. We consider surfaces with a rotational symmetry as initial data and prove a global existence and convergence result for solutions of the…
We prove a far-reaching strengthening of Szemer\'edi's regularity lemma for intersection graphs of pseudo-segments. It shows that the vertex set of such a graph can be partitioned into a bounded number of parts of roughly the same size such…
We introduce the concept of low-step multi-commodity flow emulators for any undirected, capacitated graph. At a high level, these emulators contain approximate multi-commodity flows whose paths contain a small number of edges, shattering…
Foundational models of computation often abstract away physical hardware limitations. However, in extreme environments like In-Network Computing (INC), these limitations become inviolable laws, creating an acute trilemma among communication…
We present explicit sufficient conditions that guarantee the existence and uniqueness of the feasible load-flow solution for distribution networks with a generic topology (radial or meshed) modeled with positive sequence equivalents. In the…
By carrying out a point-wise estimate for the second fundamental form, we prove a rigidity theorem of complete noncompact ancient solutions to the mean curvature flow in codimension one. Moreover, we derive an optimal growth condition.
We consider embedded, smooth curves in the plane which are either closed or asymptotic to two lines. We study their behaviour under curve shortening flow with a global forcing term. Firstly, we prove an analogue to Huisken's distance…
We identify a strong stability condition on minimal submanifolds that implies uniqueness and dynamical stability properties. In particular, we prove a uniqueness theorem and a C^1 dynamical stability theorem of the mean curvature flow for…
Recent development of techniques that improve the convergence properties of power flow simulation have been demonstrated to facilitate scaling to large system sizes (80k+ buses). However, the problem remains to reliably identify cases that…
We establish various criteria, which are known in the incompressible case, for the validity of the inviscid limit for the compressible Navier-Stokes flows considered in a general domain $\Omega$ in $\mathbb{R}^n$ with or without a boundary.…