Related papers: Finding the convex envelope of a boundary datum us…

We study the approximation properties of a harmonic function $u \in H\sp{1-k}(\Omega)$, $k > 0$, on relatively compact sub-domain $A$ of $\Omega$, using the Generalized Finite Element Method. For smooth, bounded domains $\Omega$, we obtain…

Consider a random set of points on the unit sphere in $\mathbb{R}^d$, which can be either uniformly sampled or a Poisson point process. Its convex hull is a random inscribed polytope, whose boundary approximates the sphere. We focus on the…

Let $G$ be a large (simple, unlabeled) dense graph on $n$ vertices. Suppose that we only know, or can estimate, the empirical distribution of the number of subgraphs $F$ that each vertex in $G$ participates in, for some fixed small graph…

We provide an analysis of the least gradient problem in the case when the boundary datum is only imposed on a part of the boundary. First, we give a characterisation of solutions in a general setting using convex duality theory. Then, we…

We study the approximability of general convex sets in $\mathbb{R}^n$ by intersections of halfspaces, where the approximation quality is measured with respect to the standard Gaussian distribution $N(0,I_n)$ and the complexity of an…

This paper deals with the problem of detecting non-isotropic high-dimensional geometric structure in random graphs. Namely, we study a model of a random geometric graph in which vertices correspond to points generated randomly and…

We obtain some sharp estimates for the $p$-torsion of convex planar domains in terms of their area, perimeter, and inradius. The approach we adopt relies on the use of web functions (i.e. functions depending only on the distance from the…

For a bounded domain $\Omega$ with a piecewise smooth boundary in an $n$-dimensional Euclidean space $\mathbf{R}^{n}$, we study eigenvalues of the Dirichlet eigenvalue problem of the Laplacian. First we give a general inequality for…

We study randomized sketching methods for approximately solving least-squares problem with a general convex constraint. The quality of a least-squares approximation can be assessed in different ways: either in terms of the value of the…

In this paper, we study the edge eigenvalues of random geometric graphs (RGGs) generated by multivariate Gaussian samples in the sparse regime under a broad class of distance metrics. Previous work on edge eigenvalues under related setups…

Polyhedral-type approximations of convex-like domains in $\mathbb{C}^d$ have been considered recently by the second author. In particular, the decay rate of the error in optimal volume approximation as a function of the number of facets has…

This study revisits the problem of identifying the unknown interior Robin boundary of a connected domain using Cauchy data from the exterior region of a harmonic function. It investigates two shape optimization reformulations employing…

We establish the global-wellposedness and stability of the Boltzmann equation with the specular reflection boundary condition in general smooth convex domains when an initial datum is close to the Maxwellian with or without a small external…

We prove that the torsion of any closed space curve which bounds a simply connected locally convex surface vanishes at least 4 times. This answers a question of Rosenberg related to a problem of Yau on characterizing the boundary of…

We propose a technique for calculating and understanding the eigenvalue distribution of sums of random matrices from the known distribution of the summands. The exact problem is formidably hard. One extreme approximation to the true density…

We consider the problem of sampling an edge almost uniformly from an unknown graph, $G = (V, E)$. Access to the graph is provided via queries of the following types: (1) uniform vertex queries, (2) degree queries, and (3) neighbor queries.…

We prove several results on approximation and interpolation of holomorphic Legendrian curves in convex domains in $\mathbb{C}^{2n+1}$, $n \geq 2$, with the standard contact structure. Namely, we show that such a curve, defined on a compact…

We prove a sharp lower bound for the fundamental gap on convex domains in Gaussian spaces, the difference between the first two eigenvalues of the Ornstein-Uhlenbeck operator with Dirichlet boundary conditions. Our main result establishes…

We define, for any graph $G=(V,E)$, a boundary $\partial G \subseteq V$. The definition coincides with what one would expected for the discretization of (sufficiently nice) Euclidean domains and contains all vertices from the…

We generalize the technique of [Solving Dirichlet boundary-value problems on curved domains by extensions from subdomains, SIAM J. Sci. Comput. 34, pp. A497--A519 (2012)] to elliptic problems with mixed boundary conditions and elliptic…