Related papers: Stochastic homogenisation of nonlinear minimum-cos…
Local graph clustering and the closely related seed set expansion problem are primitives on graphs that are central to a wide range of analytic and learning tasks such as local clustering, community detection, nodes ranking and feature…
We address here the problem of generating random graphs uniformly from the set of simple connected graphs having a prescribed degree sequence. Our goal is to provide an algorithm designed for practical use both because of its ability to…
Robust optimization is concerned with constructing solutions that remain feasible also when a limited number of resources is removed from the solution. Most studies of robust combinatorial optimization to date made the assumption that every…
This paper is concerned with the macroscopic behavior of global energy minimizers in the three-dimensional sharp interface unscreened Ohta-Kawasaki model of diblock copolymer melts. This model is also referred to as the nuclear liquid drop…
The aim of our work is to provide a simple homogenization and discrete-to-continuum procedure for energy driven problems involving stochastic rapidly-oscillating coefficients. Our intention is to extend the periodic unfolding method to the…
$\Gamma$-convergence methods are used to prove homogenization results for fractional obstacle problems in periodically perforated domains. The obstacles have random sizes and shapes and their capacity scales according to a stationary…
Inspired by the artwork of Mark Lombardi, we study the problem of constructing orthogonal drawings where a small number of horizontal and vertical line segments covers all vertices. We study two problems on orthogonal drawings of planar…
We investigate the consistency and convergence of flux-corrected finite element approximations in the context of nonlinear hyperbolic conservation laws. In particular, we focus on a monolithic convex limiting approach and prove a…
We consider approximation algorithms for the problem of finding $x$ of minimal norm $\|x\|$ satisfying a linear system $\mathbf{A} x = \mathbf{b}$, where the norm $\|\cdot \|$ is arbitrary and generally non-Euclidean. We show a simple…
We consider allcast and multicast flow problems where either all of the nodes or only a subset of the nodes may be in session. Traffic from each node in the session has to be sent to every other node in the session. If the session does not…
Random constraint satisfaction problems can exhibit a phase where the number of constraints per variable $\alpha$ makes the system solvable in theory on the one hand, but also makes the search for a solution hard, meaning that common…
This paper addresses the problem of minimizing a convex cost function under non-negativity and equality constraints, with the aim of solving the linear unmixing problem encountered in hyperspectral imagery. This problem can be formulated as…
We propose a distribution-free approach to the study of random geometric graphs. The distribution of vertices follows a Poisson point process with intensity function $nf(\cdot)$, where $n\in \mathbb{N}$, and $f$ is a probability density…
We revisit the static coverage control problem for placement of vehicles with simple motion on the real line, under the assumption that the cost is a polynomial function of the locations of the vehicles. The main contribution of this paper…
The Teichm\"uller harmonic map flow is a gradient flow for the harmonic map energy of maps from a closed surface to a general closed Riemannian target manifold of any dimension, where both the map and the domain metric are allowed to…
This paper considers nonconvex distributed constrained optimization over networks, modeled as directed (possibly time-varying) graphs. We introduce the first algorithmic framework for the minimization of the sum of a smooth nonconvex…
We consider the problem of jointly inferring the M-best diverse labelings for a binary (high-order) submodular energy of a graphical model. Recently, it was shown that this problem can be solved to a global optimum, for many practically…
To investigate solutions of (near-)optimal control problems, we extend and exploit a notion of homogeneity recently proposed in the literature for discrete-time systems. Assuming the plant dynamics is homogeneous, we first derive a scaling…
A vertex cover on a graph is a set of vertices in which each edge of the graph is adjacent to at least one vertex in the set. The Minimal Vertex Cover (MVC) Problem concerns finding vertex covers with a smallest cardinality. The MVC problem…
We improve on random sampling techniques for approximately solving problems that involve cuts and flows in graphs. We give a near-linear-time construction that transforms any graph on n vertices into an O(n\log n)-edge graph on the same…