Related papers: Edge-Isoperimetric Inequalities and Ball-Noise Sta…

We consider the inverse acoustic obstacle problem for sound-soft star-shaped obstacles in two dimensions wherein the boundary of the obstacle is determined from measurements of the scattered field at a collection of receivers outside the…

We investigate distributional properties of a class of spectral spatial statistics under irregular sampling of a random field that is defined on $\mathbb{R}^d$, and use this to obtain a test for isotropy. Within this context, edge effects…

We study a variant of the Erd\H{o}s Matching Problem in random hypergraphs. Let $\mathcal{K}_p(n,k)$ denote the Erd\H{o}s-R\'enyi random $k$-uniform hypergraph on $n$ vertices where each possible edge is included with probability $p$. We…

We obtain upper bounds for the isoperimetric quotients of extrinsic balls of submanifolds in ambient spaces which have a lower bound on their radial sectional curvatures. The submanifolds are themselves only assumed to have lower bounds on…

We consider the nonlinear Neumann problem for fully nonlinear elliptic PDEs on a quadrant. We establish a comparison theorem for viscosity sub and supersolutions of the nonlinear Neumann problem. The crucial argument in the proof of the…

The study of networks leads to a wide range of high dimensional inference problems. In many practical applications, one needs to draw inference from one or few large sparse networks. The present paper studies hypothesis testing of graphs in…

Let $n, r, k$ be positive integers such that $3\leq k < n$ and $2\leq r \leq k-1$. Let $m(n, r, k)$ denote the maximum number of edges an $r$-uniform hypergraph on $n$ vertices can have under the condition that any collection of $i$ edges,…

The Eady problem of baroclinic instability as applicable to quasi-geostrophic oceanic flows with zero internal PV gradients is revisited by introducing a mild slope and Ekman pumping on the lower boundary. The solution behaviour is…

Let G = (V,E) be a finite, simple and undirected graph. For $S \subseteq V$, let $\delta(S,G) = \{(u,v) \in E : u \in S \mbox {and} v \in V-S \}$ be the edge boundary of $S$. Given an integer $i$, $1 \leq i \leq | V |$, let the edge…

Given a line segment $I=[0,L]$, the so-called barrier, and a set of $n$ sensors with varying ranges positioned on the line containing $I$, the barrier coverage problem is to move the sensors so that they cover $I$, while minimising the…

We obtain a uniform $L^{\infty}(\Omega)$ a priori bound, for any positive weak solutions to elliptic problem with a nonlinearity $f$ slightly subcritical, slightly superlinear, and regularly varying. To achieve our result, we first obtain a…

In this paper we obtain some bounds on communication complexity of Gap Hamming Distance problem ($\mathsf{GHD}^n_{L, U}$): Alice and Bob are given binary string of length $n$ and they are guaranteed that Hamming distance between their…

The isoperimetric problem is one of the oldest in geometry and it consists of finding a surface of minimum area that encloses a given volume $V$. It is particularly important in physics because of its strong relation with stability, and…

Many discrete optimization problems amount to selecting a feasible set of edges of least weight. We consider in this paper the context of spatial graphs where the positions of the vertices are uncertain and belong to known uncertainty sets.…

The Erd\H{o}s distance problem concerns the least number of distinct distances that can be determined by $N$ points in the plane. The integer lattice with $N$ points is known as \textit{near-optimal}, as it spans $\Theta(N/\sqrt{\log(N)})$…

We improve the best known upper bound on the number of edges in a unit-distance graph on $n$ vertices for each $n\in\{16,\ldots,30\}$. When $n\leq 21$, our bounds match the best known lower bounds, and we fully enumerate the densest…

A fundamental problem in wireless sensor networks is to connect a given set of sensors while minimizing the \emph{receiver interference}. This is modeled as follows: each sensor node corresponds to a point in $\mathbb{R}^d$ and each…

We present a theoretical framework for characterizing incremental stability of nonlinear stochastic systems perturbed by compound Poisson shot noise and finite-measure L\'{e}vy noise. For each noise type, we compare trajectories of the…

Delsarte, Goethals, and Seidel (1977) used the linear programming method in order to find bounds for the size of spherical codes endowed with prescribed inner products between distinct points in the code. In this paper, we develop the…

The proximal gradient algorithm for minimizing the sum of a smooth and a nonsmooth convex function often converges linearly even without strong convexity. One common reason is that a multiple of the step length at each iteration may…