Related papers: Graph MBO as a semi-discrete implicit Euler scheme…
This is a survey of our work on spacelike graphic submanifolds in pseudo-Riemannian products, namely on Heinz-Chern and Bernstein-Calabi results and on the mean curvature flow, with applications to the homotopy of maps between Riemannian…
Consensus-based optimization (CBO) is a multi-agent metaheuristic derivative-free optimization algorithm that has proven to be capable of globally minimizing nonconvex nonsmooth functions across a diverse range of applications while being…
In this paper we consider the Allen-Cahn equation with constraint. In 1994, Chen and Elliott studied the asymptotic behavior of the solution of the Allen-Cahn equation with constraint. They proved that the zero level set of the solution…
We present faster algorithms for approximate maximum flow in undirected graphs with good separator structures, such as bounded genus, minor free, and geometric graphs. Given such a graph with $n$ vertices, $m$ edges along with a recursive…
We present a convergence result for solutions of the vector-valued Allen-Cahn Equation. In the spirit of the work of Luckhaus and Sturzenhecker we establish convergence towards a distributional formulation of multi-phase mean-curvature flow…
The phenomenon of apparent slip in micro-channel flows is analyzed by means of a two-phase mesoscopic lattice Boltzmann model including non-ideal fluid-fluid and fluid-wall interactins. The weakly-inhomogeneous limit of this model is solved…
We derive a continuum mean-curvature flow as a certain hydrodynamic scaling limit of a class of Glauber+Zero-range particle systems. The Zero-range part moves particles while preserving particle numbers, and the Glauber part governs the…
When mean curvature flow evolves non-uniquely, the flow is said to fatten. The work of Ilmanen shows that any weak MCF is supported inside the fattening, and work of Hershkovits--White identified canonical weak flows supported on the…
We develop a numerical method for realizing mean curvature motion of interfaces separating multiple phases, whose areas are preserved throughout time. The foundation of the method is a thresholding algorithm of the Bence-Merriman-Osher…
We study in this paper the convergence of the random splitting method for Allen-Cahn equation in a background flow that plays as a simplified model for phase separation in multiphase flows. The model does not own the gradient flow structure…
We consider the problem of finding the value of a maximum flow over time in a network with uniform edge lengths where the edge capacities change at specific time instants. To solve this problem, we show how to construct a condensed version…
The All-Pairs Max-Flow problem has gained significant popularity in the last two decades, and many results are known regarding its fine-grained complexity. Despite this, wide gaps remain in our understanding of the time complexity for…
Finding dense subgraphs is a fundamental problem with applications to community detection, clustering, and data mining. Our work focuses on finding approximate densest subgraphs in directed graphs in computational models for processing…
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 give an algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with $m$ edges and polynomially bounded integral demands, costs, and capacities in $m^{1+o(1)}$ time. Our algorithm builds the flow through a…
In this paper we present an $\tilde{O}(m\sqrt{n}\log^{O(1)}U)$ time algorithm for solving the maximum flow problem on directed graphs with $m$ edges, $n$ vertices, and capacity ratio $U$. This improves upon the previous fastest running time…
We address the problem of optimizing over functions defined on node subsets in a graph. The optimization of such functions is often a non-trivial task given their combinatorial, black-box and expensive-to-evaluate nature. Although various…
We give an $O(k^3 n \log n \min(k,\log^2 n) \log^2(nC))$-time algorithm for computing maximum integer flows in planar graphs with integer arc {\em and vertex} capacities bounded by $C$, and $k$ sources and sinks. This improves by a factor…
One method and two results are contributed to the complete understanding about MHD laminar flow in annular channel with transverse magnetic field in this paper. In terms of the method, a computationally cheap semi-analytic algorithm is…
This paper address the approximation of the dynamic of two fluids with non matching densities and viscosities modeled by the Allen-Cahn equation coupled with the time dependent Navier-Stokes equations. Existence, uniqueness and a maximum…