Related papers: Graph MBO as a semi-discrete implicit Euler scheme…
We provide a probabilistic proof of a well known connection between a special case of the Allen-Cahn equation and mean curvature flow. We then prove a corresponding result for scaling limits of the spatial $\Lambda$-Fleming-Viot process…
We show convergence of the Navier-Stokes/Allen-Cahn system to a classical sharp interface model for the two-phase flow of two viscous incompressible fluids with same viscosities in a smooth bounded domain in two and three space dimensions…
We present two graph-based algorithms for multiclass segmentation of high-dimensional data. The algorithms use a diffuse interface model based on the Ginzburg-Landau functional, related to total variation compressed sensing and image…
We present a combinatorial algorithm for computing exact maximum flows in directed graphs with $n$ vertices and edge capacities from $\{1,\dots,U\}$ in $n^{2+o(1)}\log U$ time, which is almost optimal in dense graphs. Our algorithm is a…
The famous thresholding scheme by Merriman, Bence, and Osher (Motion of multiple junctions: A level set approach. Journal of Computational Physics 112.2 (1994): 334-363.) proved itself as a very efficient time discretization of mean…
We give a deterministic $m^{1+o(1)}$ time algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with $m$ edges and polynomially bounded integral demands, costs, and capacities. As a consequence, we obtain the…
We consider the thresholding scheme, a time discretization for mean curvature flow introduced by Merriman, Bence and Osher. We prove a convergence result in the multi-phase case. The result establishes convergence towards a weak formulation…
In this paper, we develop an $O((m \log k) {\rm MSF} (n,m,1))$-time algorithm to find a half-integral node-capacitated multiflow of the maximum total flow-value in a network with $n$ nodes, $m$ edges, and $k$ terminals, where ${\rm MSF}…
In this paper, we propose a new scheme for anisotropic motion by mean curvature in $\R^d$. The scheme consists of a phase-field approximation of the motion, where the nonlinear diffusive terms in the corresponding anisotropic Allen-Cahn…
In this paper we give an $\widetilde{O}((nm)^{2/3}\log C)$ time algorithm for computing min-cost flow (or min-cost circulation) in unit capacity planar multigraphs where edge costs are integers bounded by $C$. For planar multigraphs, this…
For $n$-vertex $m$-edge graphs with integer polynomially-bounded costs and capacities, we provide a randomized parallel algorithm for the minimum cost flow problem with $\tilde O(m+n^ {1.5})$ work and $\tilde O(\sqrt{n})$ depth. On…
We introduce a simple and efficient numerical method to compute mean curvature flow with obstacles. The method augments the Merrimam-Bence-Osher scheme with a pointwise update that enforces the constraint and therefore retains the…
This paper considers and proposes some algorithms to compute the mean curvature flow under topological changes. Instead of solving the fully nonlinear partial differential equations based on the level set approach, we propose some…
We extend the analysis by Esedo\={g}lu and Otto (2015) of thresholding energies for the celebrated multiphase Bence-Merriman-Osher algorithm for computing mean curvature flow of interfacial networks, to the case of differing space-dependent…
The parabolic Allen-Cahn equation is a semilinear partial differential equation linked to the mean curvature flow by a singular perturbation. We show an improved convergence property of the parabolic Allen-Cahn equation to the mean…
In this paper we provide new randomized algorithms with improved runtimes for solving linear programs with two-sided constraints. In the special case of the minimum cost flow problem on $n$-vertex $m$-edge graphs with integer…
In 1961, Gomory and Hu showed that the All-Pairs Max-Flow problem of computing the max-flow between all $n\choose 2$ pairs of vertices in an undirected graph can be solved using only $n-1$ calls to any (single-pair) max-flow algorithm. Even…
This paper is concerned with the mean curvature flow, which describes the dynamics of a hypersurface whose normal velocity is determined by local mean curvature. We present a Cartesian grid-based method for solving mean curvature flows in…
We propose an accelerated computational fluid dynamics framework based on a hybrid Fourier Neural Operator-Lattice Boltzmann Method (FNO-LBM) for steady and unsteady weakly compressible flows. FNO-based initialization significantly…
We present an $\tilde{O}\left(m^{\frac{10}{7}}U^{\frac{1}{7}}\right)$-time algorithm for the maximum $s$-$t$ flow problem and the minimum $s$-$t$ cut problem in directed graphs with $m$ arcs and largest integer capacity $U$. This matches…