Related papers: Stochastic homogenisation of nonlinear minimum-cos…
We construct a finite-time blow-up solution to the mass-critical focusing nonlinear Schr\"odinger equation on a metric star graph with an arbitrary number of edges. We show that all solutions are global if their mass is smaller than an…
This paper is about the construction of displacement interpolations on a discrete metric graph. Our approach is based on the approximation of any optimal transport problem whose cost function is a distance on a discrete graph by a sequence…
We consider a nonlinear drift-diffusion system for multiple charged species in a porous medium in 2D and 3D with periodic microstructure. The system consists of a transport equation for the concentration of the species and Poisson's…
We introduce a new approach to the maximum flow problem in undirected, capacitated graphs using $\alpha$-\emph{congestion-approximators}: easy-to-compute functions that approximate the congestion required to route single-commodity demands…
In this paper, we consider the incompressible Stokes flow problem in a perforated domain and employ the constraint energy minimizing generalized multiscale finite element method (CEM-GMsFEM) to solve this problem. The proposed method…
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 study the $\Gamma$-convergence of sequences of free discontinuity functionals with linear growth defined in the space ${\rm BD}$ of functions with bounded deformation. We prove a compactness result with respect to $\Gamma$-convergence…
In the problem of minimum connected dominating set with routing cost constraint, we are given a graph $G=(V,E)$, and the goal is to find the smallest connected dominating set $D$ of $G$ such that, for any two non-adjacent vertices $u$ and…
In this work, we develop a new framework for dynamic network flow problems based on optimal transport theory. We show that the dynamic multi-commodity minimum-cost network flow problem can be formulated as a multi-marginal optimal transport…
We study the $\Gamma$-convergence of sequences of free-discontinuity functionals depending on vector-valued functions $u$ which can be discontinuous across hypersurfaces whose shape and location are not known a priori. The main novelty of…
This work collects some methodological insights for numerical solution of a "minimum-dispersion" control problem for nonlinear stochastic differential equations, a particular relaxation of the covariance steering task. The main ingredient…
We give an $\widetilde{O}({m^{3/2 - 1/762} \log (U+W))}$ time algorithm for minimum cost flow with capacities bounded by $U$ and costs bounded by $W$. For sparse graphs with general capacities, this is the first algorithm to improve over…
The steady motion of a viscous incompressible fluid in a multiply-connected, planar, bounded domain (perforated with a large number of small holes) is modeled through the Navier-Stokes equations with non-homogeneous Dirichlet boundary data…
This paper investigates the behavior of the Min-Sum message passing scheme to solve systems of linear equations in the Laplacian matrices of graphs and to compute electric flows. Voltage and flow problems involve the minimization of…
We investigate a homogenization problem related to a non-local interface energy with a periodic forcing term. We show the existence of planelike minimizers for such energy. Moreover, we prove that, under suitable assumptions on the…
Consider a set of $n$ vertices, where each vertex has a location in $\mathbb{R}^d$ that is sampled uniformly from the unit cube in $\mathbb{R}^d$, and a weight associated to it. Construct a random graph by placing edges independently for…
This paper focuses on finding approximate solutions to stochastic optimal control problems with control domains being not necessarily convex, where the state trajectory is subject to controlled stochastic differential equations. The…
This contribution is concerned with the effective viscosity problem, that is, the homogenization of the steady Stokes system with a random array of rigid particles, for which the main difficulty is the treatment of close particles. Standard…
Maximum flow (and minimum cut) algorithms have had a strong impact on computer vision. In particular, graph cuts algorithms provide a mechanism for the discrete optimization of an energy functional which has been used in a variety of…
In this paper, we propose a local model reduction approach for subsurface flow problems in stochastic and highly heterogeneous media. To guarantee the mass conservation, we consider the mixed formulation of the flow problem and aim to solve…