Related papers: Edge-Isoperimetric Inequalities and Ball-Noise Sta…
A $\lambda$-fold $r$-packing (multiple radius-$r$ covering) in a Hamming metric space is a code $C$ such that the radius-$r$ balls centered in $C$ cover each vertex of the space by not more (not less, respectively) than $\lambda$ times. The…
In the first part of the article, we give necessary and sufficient conditions for the solvability of a class of nonlinear elliptic boundary value problems with nonlinear boundary conditions involving the q-Laplace-Beltrami operator. In the…
The paper concerns boundary value problems for general nonautonomous first order quasilinear hyperbolic systems in a strip. We construct small global classical solutions, assuming that the right hand sides are small. In the case that all…
Line spectral estimation is a classical signal processing problem that aims to estimate the line spectra from their signal which is contaminated by deterministic or random noise. Despite a large body of research on this subject, the…
This paper studies the problem of estimation from relative measurements in a graph, in which a vector indexed over the nodes has to be reconstructed from pairwise measurements of differences between its components associated to nodes…
We address the problem of classification when data are collected from two samples with measurement errors. This problem turns to be an inverse problem and requires a specific treatment. In this context, we investigate the minimax rates of…
Assume that $M$ is a compact Riemannian manifold of bounded geometry given by restrictions on its diameter, Ricci curvature and injectivity radius. Assume we are given, with some error, the first eigenvalues of the Laplacian $\Delta_g$ on…
We develop a validated numerical procedure for continuation of local stable/unstable manifold patches attached to equilibrium solutions of ordinary differential equations. The procedure has two steps. First we compute an accurate high order…
We consider the problem of estimating the size of a maximum cut (Max-Cut problem) in a random Erd\H{o}s-R\'{e}nyi graph on $n$ nodes and $\lfloor cn \rfloor$ edges. It is shown in Coppersmith et al. ~\cite{Coppersmith2004} that the size of…
This paper completes the project started in [10]; to solve the edge-isoperimetric problem on the (generalized and extended) Sierpinski graph, S(n,m). We prove that initial segments of lexicographic order are solutions of the EIP for all…
We study a class of statistical inverse problems with non-linear pointwise operators motivated by concrete statistical applications. A two-step procedure is proposed, where the first step smoothes the data and inverts the non-linearity.…
In this article, we propose p and hp least-squares spectral element methods for one-dimensional elliptic boundary layer problems. Stability estimates are derived and we design numerical schemes based on minimizing the residuals in the sense…
Consider a stochastic nonlinear system controlled over a possibly noisy communication channel. An important problem is to characterize the largest class of channels for which there exist coding and control policies so that the closed-loop…
Recently it has been shown that the unique locally perimeter minimizing partitioning of the plane into three regions, where one region has finite area and the other two have infinite measure, is given by the so-called standard lens…
In the graph balancing problem the goal is to orient a weighted undirected graph to minimize the maximum weighted in-degree. This special case of makespan minimization is NP-hard to approximate to a factor better than 3/2 even when there…
In this work, we show, for the well-studied problem of learning parity under noise, where a learner tries to learn $x=(x_1,\ldots,x_n) \in \{0,1\}^n$ from a stream of random linear equations over $\mathrm{F}_2$ that are correct with…
Let $ M^n$ be a closed immersed minimal hypersurface in the unit sphere $\mathbb{S}^{n+1}$. We establish a special isoperimetric inequality of $M^n$. As an application, if the scalar curvature of $ M^n$ is constant, then we get a uniform…
This note provides a complete solution to a certain version of the edge-isoperimetric problem for powers of a cycle graph. Namely, it shows that the maximum number of edges inside a vertex subset of $C_n^s$ of size $k$ is achieved by a set…
The on-line nearest-neighbour graph on a sequence of $n$ uniform random points in $(0,1)^d$ ($d \in \N$) joins each point after the first to its nearest neighbour amongst its predecessors. For the total power-weighted edge-length of this…
For any positive integer $q\geq 2$ and any real number $\delta\in(0,1)$, let $\alpha_q(n,\delta n)$ denote the maximum size of a subset of $\mathbb{Z}_q^n$ with minimum Hamming distance at least $\delta n$, where…