Related papers: Stochastic homogenisation of nonlinear minimum-cos…
Recall that Janson showed that if the edges of the complete graph $K_n$ are assigned exponentially distributed independent random weights, then the expected length of a shortest path between a fixed pair of vertices is asymptotically equal…
The Minimum Dominating Set (MDS) problem is not only one of the most fundamental problems in distributed computing, it is also one of the most challenging ones. While it is well-known that minimum dominating sets cannot be approximated…
We prove a stochastic homogenization result for a class of \emph{nonlinear} and \emph{nonlocal} variational problems in domains with many small randomly distributed (bilateral) obstacles. Our model case is a Dirichlet problem for the…
The initial-value problem associated with multi-valued operators in Banach spaces is here reformulated as a minimization principle, extending results of Brezis-Ekeland, Nayroles and Fitzpatrick. At the focus there is the stability of these…
We study the problems of finding a minimum cycle basis (a minimum weight set of cycles that form a basis for the cycle space) and a minimum homology basis (a minimum weight set of cycles that generates the $1$-dimensional…
We consider a nonlinear convex stochastic homogenization problem, in a stationary setting. In practice, the deterministic homogenized energy density can only be approximated by a random apparent energy density, obtained by solving the…
We study a stochastically perturbed mean curvature flow for graphs in $\mathbb{R}^3$ over the two-dimensional unit-cube subject to periodic boundary conditions. In particular, we establish the existence of a weak martingale solution. The…
We describe a simple deterministic near-linear time approximation scheme for uncapacitated minimum cost flow in undirected graphs with real edge weights, a problem also known as transshipment. Specifically, our algorithm takes as input a…
Sampling equilibrium distributions is fundamental to statistical mechanics. While flow matching has emerged as scalable state-of-the-art paradigm for generative modeling, its potential for equilibrium sampling in condensed-phase systems…
The blow-up lemma states that a system of super-regular pairs contains all bounded degree spanning graphs as subgraphs that embed into a corresponding system of complete pairs. This lemma has far-reaching applications in extremal…
We study efficient simulation of steady state for rarefied gas flow, which is modeled by the Boltzmann equation with BGK-type collision term. A nonlinear multigrid solver is proposed to resolve the efficiency issue by the following…
We study a class of nonconvex nonsmooth optimization problems in which the objective is a sum of two functions: One function is the average of a large number of differentiable functions, while the other function is proper, lower…
We present a graph-based numerical method for solving hyperbolic systems of conservation laws using discontinuous finite elements. This work fills important gaps in the theory as well as practice of graph-based schemes. In particular, four…
We perform the homogenization process avoiding the necessity of testing the weak formulation of the initial and homogenized systems by corresponding weak solutions. We show that the stress tensor for homogenized problem depends on the…
Recently we have developed a new method in graph theory based on the Regularity Lemma. The method is applied to find certain spanning subgraphs in dense graphs. The other main general tool of the method, beside the Regularity Lemma, is the…
We examine a steepest energy descent flow with obstacle constraint in higher order energy frameworks where the maximum principle is not available. We construct the flow under general assumptions using De Giorgi's minimizing movement scheme.…
In recent works, we have proposed a stochastic cellular automaton model of traffic flow connecting two exactly solvable stochastic processes, i.e., the Asymmetric Simple Exclusion Process and the Zero Range Process, with an additional…
In this article, we address the solution of advection-dominated flow problems by stabilised methods, by means of least-squares computed stabilised coefficients. As main methodological tool, we introduce a data-driven off-line/on-line…
This doctoral thesis is devoted to the analysis of some minimization problems that involve nonlocal functionals. We are mainly concerned with the $s$-fractional perimeter and its minimizers, the $s$-minimal sets. We investigate the behavior…
We consider a system of differential equations in a fast long range dependent random environment and prove a homogenization theorem involving multiple scaling constants. The effective dynamics solves a rough differential equation, which is…