Related papers: Riemannian and Lorentzian flow-cut theorems
We point out that the geometry of connected totally geodesic compact null hypersurfaces in Lorentzian manifolds is only slightly more specialized than that of Riemannian flows over compact manifolds, the latter mathematical theory having…
This paper gives two different proofs to a structural theorem of decreasing minimization (lexicographic optimization) on integrally convex sets. The theorem states that the set of decreasingly minimal elements of an integrally convex set…
In this paper we prove convergence and compactness results for Ricci flows with bounded scalar curvature and entropy. More specifically, we show that Ricci flows with bounded scalar curvature converge smoothly away from a singular set of…
This paper generalizes the Max-Flow Min-Cut (MFMC) theorem from the setting of numerical capacities to sheaves of partial semimodules over semirings on directed graphs. Motivating examples of partial semimodules include probability…
Finding a maximum cut is a fundamental task in many computational settings. Surprisingly, it has been insufficiently studied in the classic distributed settings, where vertices communicate by synchronously sending messages to their…
Diffusion is a fundamental graph procedure and has been a basic building block in a wide range of theoretical and empirical applications such as graph partitioning and semi-supervised learning on graphs. In this paper, we study…
We present a new lower bound on the number of contingency tables, improving upon and extending previous lower bounds by Barvinok and Gurvits. As an application, we obtain new lower bounds on the volumes of flow and transportation polytopes.…
We consider the 1-harmonic flow of maps from a bounded domain into a submanifold of a Euclidean space, i.e. the gradient flow of the total variation functional restricted to maps taking values in the manifold. We restrict ourselves to…
We introduce a methodology to study the possible matter flows of an ecosystem defined by observational biomass data and realistic biological constraints. The flows belong to a polyhedron in a multi dimensional space making statistical…
We propose some algorithms to find local minima in nonconvex optimization and to obtain global minima in some degree from the Newton Second Law without friction. With the key observation of the velocity observable and controllable in the…
In this paper we prove a version of the Fountain Theorem for a class of nonsmooth functionals that are sum of a $C^1$ functional and a convex lower semicontinuous functional, and also a version of a theorem due to Heinz for this class of…
We develop a geometric flow framework to investigate two classical shape functionals: the torsional rigidity and the first Dirichlet eigenvalue of the Laplacian. First, by constructing novel deformation paths governed by height-stretching…
An ideal compressible fluid is considered, with an equilibrium density being a given function of coordinates due to presence of some static external forces. The slow flows in such system, which do not disturb the density, are investigated…
An evolving surface finite element discretisation is analysed for the evolution of a closed two-dimensional surface governed by a system coupling a generalised forced mean curvature flow and a reaction--diffusion process on the surface,…
This article provides numerical evidence that under volume constraint the ball is the set which maximizes the perimeter of the least-perimeter partition into cells with prescribed areas. We introduce a numerical maximization algorithm which…
We suggest a global perspective on dynamic network flow problems that takes advantage of the similarities to port-Hamiltonian dynamics. Dynamic minimum cost flow problems are formulated as open-loop optimal control problems for general…
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…
We consider the regular Lagrangian flow X associated to a bounded divergence-free vector field b with bounded variation. We prove a Lusin-Lipschitz regularity result for X and we show that the Lipschitz constant grows at most linearly in…
We introduce a numerical method for extracting minimal geodesics along the group of volume preserving maps, equipped with the L2 metric, which as observed by Arnold solve Euler's equations of inviscid incompressible fluids. The method…
We propose a linear programming (LP) framework for steady-state diffusion and flux optimization on geometric networks. The state variable satisfies a discrete diffusion law on a weighted, oriented graph, where conductances are scaled by…