Related papers: Riemannian and Lorentzian flow-cut theorems
A lexicographic maximum of a set $X \subseteq \mathbb{R}^n$ is a vector in $X$ whose smallest component is as large as possible, and subject to that requirement, whose second smallest component is as large as possible, and so on for the…
This paper proposes novel gradient-flow schemes that yield convergence to the optimal point of a convex optimization problem within a \textit{fixed} time from any given initial condition for unconstrained optimization, constrained…
In Lorentz-Minkowski space, we prove that the conjugate surface of a maximal graph over a convex domain is also a graph. We provide three proofs of this result that show a suitable correspondence between maximal surfaces in…
In its most general form, the optimal transport problem is an infinite-dimensional optimization problem, yet certain notable instances admit closed-form solutions. We identify the common source of this tractability as \textit{symmetry} and…
We introduce the notion of {\em fair cuts} as an approach to leverage approximate $(s,t)$-mincut (equivalently $(s,t)$-maxflow) algorithms in undirected graphs to obtain near-linear time approximation algorithms for several cut problems.…
In our previous work we showed that for an ancient solution to the Ricci flow with nonnegative curvature operator, assuming bounded geometry on one time slice, bounded entropy implies noncollapsing on all scales. In this paper we prove the…
We consider a geodesic flow on a compact manifold endowed with a Riemannian (or Finsler, or Lorentz) metric satisfying some generic, explicit conditions. We couple the geodesic flow with a time-dependent potential, driven by an external…
We derive the nonlinear equations satisfied by the coefficients of linear combinations that maximize their skewness when their variance is constrained to take a specific value. In order to numerically solve these nonlinear equations we…
This paper presents a geometric microcanonical ensemble perspective on two-dimensional Truncated Euler flows, which contain a finite number of (Fourier) modes and conserve energy and enstrophy. We explicitly perform phase space volume…
Local graph clustering and the closely related seed set expansion problem are primitives on graphs that are central to a wide range of analytic and learning tasks such as local clustering, community detection, nodes ranking and feature…
The closed string field theory minimal-area problem asks for the conformal metric of least area on a Riemann surface with the condition that all non-contractible closed curves have length at least 2\pi. This is an extremal length problem in…
Flow Matching has recently gained attention in generative modeling as a simple and flexible alternative to diffusion models. While existing statistical guarantees adapt tools from the analysis of diffusion models, we take a different…
In this paper we prove Hessian and Laplacian comparison theorems for the Lorentzian distance function in a spacetime with sectional (or Ricci) curvature bounded by a certain function by means of a comparison criterion for Riccati equations.…
The evolution of a closed two-dimensional surface driven by both mean curvature flow and a reaction--diffusion process on the surface is formulated into a system, which couples the velocity law not only to the surface partial differential…
We study the problem of finding flows in undirected graphs so as to minimize the weighted $p$-norm of the flow for any $p > 1$. When $p=2$, the problem is that of finding an electrical flow, and its dual is equivalent to solving a Laplacian…
In 1966, Arnold [1] showed that the Lagrangian flow of ideal incompressible fluids (described by Euler equations) coincide with the geodesic flow on the manifold of volume preserving diffeomorphisms of the fluid domain. Arnold's proof and…
We investigate the problem of efficiently computing optimal transport (OT) distances, which is equivalent to the node-capacitated minimum cost maximum flow problem in a bipartite graph. We compare runtimes in computing OT distances on data…
The aim of this paper is to adapt the general multitime maximum principle to a Riemannian setting. More precisely, we intend to study geometric optimal control problems constrained by the metric compatibility evolution PDE system; the…
The logarithmic divergence is an extension of the Bregman divergence motivated by optimal transport and a generalized convex duality, and satisfies many remarkable properties. Using the geometry induced by the logarithmic divergence, we…
This paper bridges discrete and continuous optimization approaches for decomposable submodular function minimization, in both the standard and parametric settings. We provide improved running times for this problem by reducing it to a…