Related papers: Edge-Isoperimetric Inequalities and Ball-Noise Sta…
The numerical analysis for the small amplitude motion of an elastic beam with internal damping is investigated in domain with moving ends. An efficient numerical method is constructed to solve this moving boundary problem. The stability and…
In the noisy query model, the (binary) return value of every query (possibly repeated) is independently flipped with some fixed probability $p \in (0, 1/2)$. In this paper, we obtain tight bounds on the noisy query complexity of several…
We study isoperimetric inequalities on "slabs", namely weighted Riemannian manifolds obtained as the product of the uniform measure on a finite length interval with a codimension-one base. As our two main applications, we consider the case…
In the {\sc Test Cover} problem we are given a hypergraph $H=(V, \mathcal{E})$ with $|V|=n, |\mathcal{E}|=m$, and we assume that $\mathcal{E}$ is a test cover, i.e. for every pair of vertices $x_i, x_j$, there exists an edge $e \in…
In this work, we investigate the inverse problem of determining a quasilinear term appearing in a nonlinear elliptic equation from the measurement of the conormal derivative on the boundary. This problem arises in several practical…
We give exact values and bounds on the isoperimetric peak of complete trees, improving on known results. For the complete $q$-ary tree of depth $d$, if $q\ge 5$, then we find that the isoperimetric peak equals $d$, completing an open…
This paper investigates the optimal ergodic sublinear convergence rate of the relaxed proximal point algorithm for solving monotone variational inequality problems. The exact worst case convergence rate is computed using the performance…
We apply recently developed convex programs to find the minimal-area Riemannian metric on $2n$-sided polygons ($n\geq 3$) with length conditions on curves joining opposite sides. We argue that the Riemannian extremal metric coincides with…
We study the problem of estimating the number of edges in an unknown graph. We consider a hybrid model in which an algorithm may issue independent set, degree, and neighbor queries. We show that this model admits strictly more efficient…
We study the minimum number of constraints needed to formulate random instances of the maximum stable set problem via linear programs (LPs), in two distinct models. In the uniform model, the constraints of the LP are not allowed to depend…
In the study of high-dimensional data, it is often assumed that the data set possesses an underlying lower-dimensional structure. A practical model for this structure is an embedded compact manifold with boundary. Since the underlying…
In this work we study approximation algorithms for the \textit{Bounded Color Matching} problem (a.k.a. Restricted Matching problem) which is defined as follows: given a graph in which each edge $e$ has a color $c_e$ and a profit $p_e \in…
In [2] we introduced a method combining together an observability inequality and a spectral decomposition to get a logarithmic stability estimate for the inverse problem of determining both the potential and the damping coefficient in a…
Two kinds of approximation algorithms exist for the k-BALANCED PARTITIONING problem: those that are fast but compute unsatisfying approximation ratios, and those that guarantee high quality ratios but are slow. In this paper we prove that…
Let $ \Omega \subsetneq \mathbf{R}^n\,(n\geq 2)$ be an unbounded convex domain. We study the minimal surface equation in $\Omega$ with boundary value given by the sum of a linear function and a bounded uniformly continuous function in $…
There has been an emerging trend in non-Euclidean statistical analysis of aiming to recover a low dimensional structure, namely a manifold, underlying the high dimensional data. Recovering the manifold requires the noise to be of certain…
This paper develops validated computational methods for studying infinite dimensional stable manifolds at equilibrium solutions of parabolic PDEs, synthesizing disparate errors resulting from numerical approximation. To construct our…
Consider the following problem: given a graph with edge costs and a subset Q of vertices, find a minimum-cost subgraph in which there are two edge-disjoint paths connecting every pair of vertices in Q. The problem is a failure-resilient…
The problem of establishing out-of-sample bounds for the values of an unkonwn ground-truth function is considered. Kernels and their associated Hilbert spaces are the main formalism employed herein along with an observational model where…
We consider the non-parametric regression problem under Huber's $\epsilon$-contamination model, in which an $\epsilon$ fraction of observations are subject to arbitrary adversarial noise. We first show that a simple local binning median…