Related papers: The Convex Geometry of Network Flows
Flows on surfaces are one of the most fundamental and classical objects in dynamical systems, and are studied from various areas (e.g. integrable systems, differential equations, fluid mechanics). Though hyperbolic flows and recurrent flows…
Two fluid configurations along a flow are conjugate if there is a one parameter family of geodesics (fluid flows) joining them to infinitesimal order. Geometrically, they can be seen as a consequence of the (infinite dimensional) group of…
In this paper, we study the locally constrained inverse curvature flow for hypersurfaces in the half-space with $\theta$-capillary boundary, which was recently introduced by Wang-Weng-Xia. Assume that the initial hypersurface is strictly…
Certifying power flow solvability is important for reliable power system operations under volatile operating conditions, but solving power flow equations repeatedly can be costly and may encounter convergence issues. In this paper, we…
Small depth networks arise in a variety of network related applications, often in the form of maximum flow and maximum weighted matching. Recent works have generalized such methods to include costs arising from concave functions. In this…
Let $L=\DD+Z$ for a $C^1$ vector field $Z$ on a complete Riemannian manifold possibly with a boundary. By using the uniform distance, a number of transportation-cost inequalities on the path space for the (reflecting) $L$-diffusion process…
We develop two-scale methods for computing the convex envelope of a continuous function over a convex domain in any dimension.This hinges on a fully nonlinear obstacle formulation [A. M. Oberman, "The convex envelope is the solution of a…
This paper considers the optimization-based traffic allocation problem among multiple end points in connectionless networks. The network utility function is modeled as a non-concave function, since it is the best description of the quality…
We prove several geometric theorems using tools from the theory of convex optimization. In the Riemannian setting, we prove the max flow-min cut theorem for boundary regions, applied recently to develop a "bit-thread" interpretation of…
In the first part of the paper we survey some nonlocal flows of convex plane curves ever studied so far and discuss properties of the flows related to enclosed area and length, especially the isoperimetric ratio and the isoperimetric…
In the last 15 years, White and Huisken-Sinestrari developed a far-reaching structure theory for the mean curvature flow of mean convex hypersurfaces. Their papers provide a package of estimates and structural results that yield a precise…
In this paper we consider convex subsets of locally-convex topological vector spaces. Given a fixed point in such a convex subset, we show that there exists a curve completely contained in the convex subset and leaving the point in a given…
In this paper, we prove the existence of mean curvature flow with surgery for mean-convex surfaces with free boundary. To do so, we implement our recent new approach for constructing flows with surgery without a prior estimates in the free…
We study a continuous-time dynamical system which arises as the limit of a broad class of nonlinearly preconditioned gradient methods. Under mild assumptions, we establish existence of global solutions and derive Lyapunov-based convergence…
In this paper, we present a general framework for efficiently computing diverse solutions to combinatorial optimization problems. Given a problem instance, the goal is to find $k$ solutions that maximize a specified diversity measure; the…
The description of free surface flows can often be simplified to thin film (or lubrication) equations, when the slopes of the liquid-gas interface are small. Here we present a long wavelength theory that remains fully quantitative for steep…
We perform an exhaustive study of the simplest, nontrivial problem in advection-diffusion -- a finite absorber of arbitrary cross section in a steady two-dimensional potential flow of concentrated fluid. This classical problem has been…
Assignment flows denote a class of dynamical models for contextual data labeling (classification) on graphs. We derive a novel parametrization of assignment flows that reveals how the underlying information geometry induces two processes…
Motivated by a constrained minimization problem, it is studied the gradient flows with respect to Hessian Riemannian metrics induced by convex functions of Legendre type. The first result characterizes Hessian Riemannian structures on…
We investigate for the first time the curve shortening flow in the metric-affine plane and prove that under simple geometric condition it shrinks a closed convex curve to a "round point" in finite time. This generalizes the classical result…