Related papers: The Convex Geometry of Network Flows
The branched transport problem, a popular recent variant of optimal transport, is a non-convex and non-smooth variational problem on Radon measures. The so-called urban planning problem, on the contrary, is a shape optimization problem that…
In this paper, we consider the anisotropic $\alpha$-Gauss curvature flow for complete noncompact convex hypersurfaces in the Euclidean space with the anisotropy determined by a smooth closed uniformly convex Wulff shape. We show that for…
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…
We consider the robust version of a multi-commodity network flow problem. The robustness is defined with respect to the deletion, or failure, of edges. While the flow problem itself is a polynomially-sized linear program, its robust version…
We prove a complete family of `cylindrical estimates' for solutions of a class of fully non-linear curvature flows, generalising the cylindrical estimate of Huisken-Sinestrari for the mean curvature flow. More precisely, we show that, for…
We establish a sharp rate of convergence for a free-boundary curve shortening flow in a convex domain in $\mathbb{R}^{2}$ which converges in finite time to a round half-point.
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…
In this paper, we study curve shortening flows on rotational surfaces in $\mathbb{R}^3$. We assume that the surfaces have negative Gauss curvatures and that some condition related to the Gauss curvature and the curvature of embedded curve…
A compact and efficient numerical method is described for studying plane flows of an ideal fluid with a smooth free boundary over a curved and nonuniformly moving bottom. Exact equations of motion in terms of the so-called conformal…
Over the past few years, we developed a mathematically rigorous method to study the dynamical processes associated to nonlinear Forchheimer flows for slightly compressible fluids. We have proved the existence of a geometric transformation…
We consider the continuous Fermat-Weber problem, where the customers are continuously (uniformly) distributed along the boundary of a convex polygon. We derive the closed-form expression for finding the average distance from a given point…
This paper aims to maximize algebraic connectivity of networks via topology design under the presence of constraints and an adversary. We are concerned with three problems. First, we formulate the concave maximization topology design…
Surface-subsurface flow models for hydrological applications solve a coupled multiphysics problem. This usually consists of some form of the Richards and shallow water equations. A typical setup couples these two nonlinear partial…
In this paper, we study the mean curvature type flow for hypersurfaces in the unit Euclidean ball with capillary boundary, which was introduced by Wang-Xia and Wang-Weng. We show that if the initial hypersurface is strictly convex, then the…
The concave utility in the Network Utility Maximization (NUM) problem is only suitable for elastic flows. However, the networks with the multiclass traffic, the utility of inelastic traffic is usually represented by the sigmoidal function…
Motivated by the challenge of analyzing data sets with periodic boundary conditions to investigate transportation properties, we introduce a concept of circular max-flow for graphs mapped onto the circle. Unlike classical max-flow…
This article presents an analysis of the normalized Yamabe flow starting at and preserving a class of compact Riemannian manifolds with incomplete edge singularities and negative Yamabe invariant. Our main results include uniqueness,…
We define and study a class of subshifts of finite type (SFTs) defined by a family of allowed patterns of the same shape where, for any contents of the shape minus a corner, the number of ways to fill in the corner is the same. The main…
Flows in networks (or graphs) play a significant role in numerous computer vision tasks. The scalar-valued edges in these graphs often lead to a loss of information and thereby to limitations in terms of expressiveness. For example,…
This is a survey of some of the recent developments on the geometric and analytic aspects of the Anomaly flow. It is a flow of $(2,2)$-forms on a $3$-fold which was originally motivated by string theory and the need to preserve the…