Related papers: Finding the convex envelope of a boundary datum us…
We derive normal approximation bounds in the Wasserstein distance for sums of weighted U-statistics, based on a general distance bound for functionals of independent random variables of arbitrary distributions. Those bounds are applied to…
We study the free boundary problem for the equations of compressible Euler equations with a vacuum boundary condition. Our main goal is to recover in Eulerian coordinates the earlier well-posedness result obtained by Lindblad [Lindblad H.,…
We consider an inverse boundary value problem for the Maxwell's equations with a given data assumed to be known only in accessible part $\Gamma$ of the boundary. We aim to prove an uniqueness result using the Dirichlet to Neumann map with…
The Convex Envelope of a given function was recently characterized as the solution of a fully nonlinear Partial Differential Equation (PDE). In this article we study a modified problem: the Dirichlet problem for the underlying PDE. The main…
We quantify the large deviations of Gaussian extreme value statistics on closed convex sets in d-dimensional Euclidean space. The asymptotics imply that the extreme value distribution exhibits a rate function that is a simple quadratic…
We study wave maps with values in S^d, defined on the future light cone {|x| <= t}, with prescribed data at the boundary {|x| = t}. Based on the work of Keel and Tao, we prove that the problem is well-posed for locally absolutely continuous…
Motivated by previous efforts toward mathematically analyzing the treatment of monomials in spatial branch-and-bound, we study the convex hull of the graph of a simple monomial on a nonnegative box domain in arbitrary dimension, where at…
We provide an algorithm, running in polynomial time in the number of vertices, computing the unique solution to the biased infinity Laplacian Boundary Problem on finite graphs. The algorithm is based on the general outline and approach…
We consider an evolution equation similar to that introduced by Vese and whose solution converges in large time to the convex envelope of the initial datum. We give a stochastic control representation for the solution from which we deduce,…
We study the intersection of a random geometric graph with an Erd\H{o}s-R\'enyi graph. Specifically, we generate the random geometric graph $G(n, r)$ by choosing $n$ points uniformly at random from $D=[0, 1]^2$ and joining any two points…
Sweeping is a powerful and versatile method of designing objects. Boundary of volumes (henceforth envelope) obtained by sweeping solids have been extensively investigated in the past, though, obtaining an accurate parametrization of the…
A surface with boundary is randomly generated by gluing polygons along some of their sides. We show that its genus and number of boundary components asymptotically follow a bivariate normal distribution.
We consider the eigenvalue problem for the case where the input matrix is symmetric and its entries perturb in some given intervals. We present a characterization of some of the exact boundary points, which allows us to introduce an inner…
We use novel integral representations developed by the second author to prove certain rigorous results concerning elliptic boundary value problems in convex polygons. Central to this approach is the so-called global relation, which is a…
We prove well-posedness and regularity results for elliptic boundary value problems on certain domains with a smooth set of singular points. Our class of domains contains the class of domains with isolated oscillating conical singularities,…
We give the first differentially private algorithms that estimate a variety of geometric features of points in the Euclidean space, such as diameter, width, volume of convex hull, min-bounding box, min-enclosing ball etc. Our work relies…
We prove that all locally exposable points in a Stein compact in a complex space can be exposed along a given curve to a given real hypersurface. Moreover, the exposing map for a boundary point can be sufficiently close to the identity map…
We give lower bounds for the first non-zero Steklov eigenvalue on connected graphs. These bounds depend on the extrinsic diameter of the boundary and not on the diameter of the graph. We obtain a lower bound which is sharp when the cardinal…
We present a method for computing the topological entropy of one-dimensional maps. As an approximation scheme, the algorithm converges rapidly and provides both upper and lower bounds.
Random geometric graphs result from taking $n$ uniformly distributed points in the unit cube, $[0,1]^d$, and connecting two points if their Euclidean distance is at most $r$, for some prescribed $r$. We show that monotone properties for…