Related papers: Edge-Isoperimetric Inequalities and Ball-Noise Sta…
We study an inhomogeneous Neumann boundary value problem for functions of least gradient on bounded domains in metric spaces that are equipped with a doubling measure and support a Poincar\'e inequality. We show that solutions exist under…
In this short note, we establish an edge-isoperimetric inequality for arbitrary product graphs. Our inequality is sharp for subsets of many different sizes in every product graph. In particular, it implies that the $2^d$-element sets with…
On a Riemannian manifold with a positive lower bound on the Ricci tensor, the distance of isoperimetric sets from geodesic balls is quantitatively controlled in terms of the gap between the isoperimetric profile of the manifold and that of…
We study distributed protocols for finding all pairs of similar vectors in a large dataset. Our results pertain to a variety of discrete metrics, and we give concrete instantiations for Hamming distance. In particular, we give improved…
We study the boundary rigidity problem with partial data consisting of determining locally the Riemannian metric of a Riemannian manifold with boundary from the distance function measured at pairs of points near a fixed point on the…
We obtain a sharp quantitative isoperimetric inequality for nonlocal $s$-perimeters, uniform with respect to $s$ bounded away from $0$. This allows us to address local and global minimality properties of balls with respect to the…
This paper is devoted to the problem of determining the concentration bounds that are achievable in non-parametric regression. We consider the setting where features are supported on a bounded subset of $\mathbb{R}^d$, the regression…
In this paper we introduce and study a new problem named \emph{min-max edge $q$-coloring} which is motivated by applications in wireless mesh networks. The input of the problem consists of an undirected graph and an integer $q$. The goal is…
We prove a vertex isoperimetric inequality for the $n$-dimensional Hamming ball $\mathcal{B}_n(R)$ of radius $R$. The isoperimetric inequality is sharp up to a constant factor for sets that are comparable to $\mathcal{B}_n(R)$ in size. A…
In this paper, we establish robustness to noise perturbations of polyhedral regularization of linear inverse problems. We provide a sufficient condition that ensures that the polyhedral face associated to the true vector is equal to that of…
In this work, we investigate data fitting problems with random noises. A randomized progressive iterative regularization method is proposed. It works well for large-scale matrix computations and converges in expectation to the least-squares…
This paper studies the asymptotic stability of solution to an initial-boundary value problem for a hyperbolic-elliptic coupled system on two-dimensional half space, where the data on the boundary and at the far field are prescribed as $u_-$…
We study the robust interpolation problem of arbitrary data distributions supported on a bounded space and propose a two-fold law of robustness. Robust interpolation refers to the problem of interpolating $n$ noisy training data points in…
The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to decide whether the Hamming distance between their $n$-bit…
We study the isoperimetric problem for Euclidean space endowed with a continuous density. In dimension one, we characterize isoperimetric regions for a unimodal density. In higher dimensions, we prove existence results and we derive…
We decrease the $rms$ mean curvature and area of a variable surface with a fixed boundary by iterating a few times through a curvature-based variational algorithm. For a boundary with a known minimal surface, starting with a deliberately…
We solve a class of isoperimetric problems on $\mathbb{R}^2_+ :=\left\{ (x,y)\in \mathbb{R} ^2 : y>0 \right\}$ with respect to monomial weights. Let $\alpha $ and $\beta $ be real numbers such that $0\le \alpha <\beta+1$, $\beta\le 2…
It was proved by Almgren that among boundaries whose mean curvature is bounded from above, perimeter is uniquely minimized by balls. We obtain sharp stability estimates for Almgren's isoperimetric principle and, as an application, we deduce…
In this paper we study a maximization version of the classical Edge Dominating Set (EDS) problem, namely, the Upper EDS problem, in the realm of Parameterized Complexity. In this problem, given an undirected graph $G$, a positive integer…
A monitoring edge-geodetic set of a graph is a subset $M$ of its vertices such that for every edge $e$ in the graph, deleting $e$ increases the distance between at least one pair of vertices in $M$. We study the following computational…