Related papers: Optimal design for the planar Skorokhod embedding …
A $\textit{compression scheme}$ $A$ for a class $\mathbb{G}$ of graphs consists of an encoding algorithm $\textit{Encode}_A$ that computes a binary string $\textit{Code}_A(G)$ for any given graph $G$ in $\mathbb{G}$ and a decoding algorithm…
In this paper, the local wellposedness of a general Gross-Pitaevskii equation with rough potential is proven in dimension 2. The class of rough potentials we are considering is large enough to contain the spatial white noise and thus a…
A fundamental question asks how uniformly finite sets of pure quantum states can be distributed in a Hilbert space. The Welch bounds address this question, and are saturated by $k$-designs, i.e. sets of states reproducing the $k$-th Haar…
We study the asymmetric low-rank factorization problem: \[\min_{\mathbf{U} \in \mathbb{R}^{m \times d}, \mathbf{V} \in \mathbb{R}^{n \times d}} \frac{1}{2}\|\mathbf{U}\mathbf{V}^\top -\mathbf{\Sigma}\|_F^2\] where $\mathbf{\Sigma}$ is a…
The Standard Simplex Conjecture of Isaksson and Mossel asks for the partition $\{A_{i}\}_{i=1}^{k}$ of $\mathbb{R}^{n}$ into $k\leq n+1$ pieces of equal Gaussian measure of optimal noise stability. That is, for $\rho>0$, we maximize $$…
The Poisson problem consists in finding an immersed surface $\Sigma\subset\mathbb{R}^m$ minimising Germain's elastic energy (known as Willmore energy in geometry) with prescribed boundary, boundary Gauss map and area which constitutes a…
This paper examines a variety of classical optimization problems, including well-known minimization tasks and more general variational inequalities. We consider a stochastic formulation of these problems, and unlike most previous work, we…
The Az\'{e}ma-Yor solution (resp., the Perkins solution) of the Skorokhod embedding problem has the property that it maximizes (resp., minimizes) the law of the maximum of the stopped process. We show that these constructions have a wider…
We present a mass lumping approach based on an isogeometric Petrov-Galerkin method that preserves higher-order spatial accuracy in explicit dynamics calculations irrespective of the polynomial degree of the spline approximation. To…
We provide a priori error estimates for variational approximations of the ground state eigenvalue and eigenvector of nonlinear elliptic eigenvalue problems of the form $-{div} (A\nabla u) + Vu + f(u^2) u = \lambda u$, $\|u\|_{L^2}=1$. We…
We study the local and global wellposedness of the initial-boundary value problem for the biharmonic Schr\"odinger equation on the half-line with inhomogeneous Dirichlet-Neumann boundary data. First, we obtain a representation formula for…
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…
We address the fundamental network design problem of constructing approximate minimum spanners. Our contributions are for the distributed setting, providing both algorithmic and hardness results. Our main hardness result shows that an…
We study the complexity of geometric problems on spaces of low fractal dimension. It was recently shown by [Sidiropoulos & Sridhar, SoCG 2017] that several problems admit improved solutions when the input is a pointset in Euclidean space…
We study a minimizing problem associated with the singular problem \[ \left\{ \begin{array} [c]{ll} -\operatorname{div}\left( \left\vert \nabla u\right\vert ^{p-2}\nabla u\right) =\lambda u^{-1} & \mathrm{in\ }\Omega\\ u>0 & \mathrm{in\…
Energy minimization algorithms, such as graph cuts, enable the computation of the MAP solution under certain probabilistic models such as Markov random fields. However, for many computer vision problems, the MAP solution under the model is…
Dimension reduction algorithms are a crucial part of many data science pipelines, including data exploration, feature creation and selection, and denoising. Despite their wide utilization, many non-linear dimension reduction algorithms are…
We obtain a new proof of Bobkov's lower bound on the first positive eigenvalue of the (negative) Neumann Laplacian (or equivalently, the Cheeger constant) on a bounded convex domain $K$ in Euclidean space. Our proof avoids employing the…
Tutte's spring embedding theorem states that, for a three-connected planar graph, if the outer face of the graph is fixed as the complement of some convex region in the plane, and all other vertices are placed at the mass center of their…
Let $D={\mathbb H} \setminus \cup_{k=1}^N C_k$ be a standard slit domain, where ${\mathbb H}$ is the upper half plane and $C_k$, $1\leq k\leq N$, are mutually disjoint horizontal line segments in $H$. Given a Jordan arc $\gamma\subset D$…