Related papers: Almost sure convergence of the minimum bipartite m…

Pick n points independently at random in R^2, according to a prescribed probability measure mu, and let D^n_1 <= D^n_2 <= ... be the areas of the binomial n choose 3 triangles thus formed, in non-decreasing order. If mu is absolutely…

Given a point set P in 2D, the problem of finding the smallest set of unit disks that cover all of P is NP-hard. We present a simple algorithm for this problem with an approximation factor of 25/6 in the Euclidean norm and 2 in the max…

For any integers $d, n \geq 2$ and $1/({\min\{n,d\}})^{0.4999} < \varepsilon<1$, we show the existence of a set of $n$ vectors $X\subset \mathbb{R}^d$ such that any embedding $f:X\rightarrow \mathbb{R}^m$ satisfying $$ \forall x,y\in X,\…

Let $(X,d)$ be a compact metric space and $\mu$ a Borel probability on $X$. For each $N\geq 1$ let $d^N_\infty$ be the $\ell_\infty$-product on $X^N$ of copies of $d$, and consider $1$-Lipschitz functions $X^N\to\mathbb{R}$ for…

Two-sample hypothesis testing-determining whether two sets of data are drawn from the same distribution-is a fundamental problem in statistics and machine learning with broad scientific applications. In the context of nonparametric testing,…

We consider the problem of approximating the unknown density $u\in L^2(\Omega,\lambda)$ of a measure $\mu$ on $\Omega\subset\R^n$, absolutely continuous with respect to some given reference measure $\lambda$, from the only knowledge of…

We give upper bounds for the number $\Phi_\ell(G)$ of matchings of size $\ell$ in (i) bipartite graphs $G=(X\cup Y, E)$ with specified degrees $d_x$ ($x\in X$), and (ii) general graphs $G=(V,E)$ with all degrees specified. In particular,…

We consider cubic NLS in dimensions 2, 3, 4 and we prove that almost surely solutions with randomized initial data at low regularity scatter. Moreover, we establish some smoothing properties of the associated scattering operator and precise…

Maximum bipartite matching is a fundamental algorithmic problem which can be solved in polynomial time. We consider a natural variant in which there is a separation constraint: the vertices on one side lie on a path or a grid, and two…

Given a collection of probability distributions $p_{1},\ldots,p_{m}$, the minimum entropy coupling is the coupling $X_{1},\ldots,X_{m}$ ($X_{i}\sim p_{i}$) with the smallest entropy $H(X_{1},\ldots,X_{m})$. While this problem is known to be…

We study Bayesian inference of an unknown matching $\pi^*$ between two correlated random point sets $\{X_i\}_{i=1}^n$ and $\{Y_i\}_{i=1}^n$ in $[0,1]^d$, under a critical scaling $\|X_i-Y_{\pi^*(i)}\|_2 \asymp n^{-1/d}$, in both an exact…

For the Bergman projection operator $P$ we prove that $ \|P\|_{{L^1(B,d\lambda)\rightarrow B_1}}= \frac {(2n+1)!}{n!}.$ Here $\lambda$ stands for the invariant metric in the unit ball $B$ of $\mathbf{C}^n$, and $B_1$ denotes the Besov space…

Given a regular compact set $E$ in the complex plane, a unit measure $\mu$ supported by $\partial E,$ a triangular point set $\beta := \{\{\beta_{n,k}\}_{k=1}^n\}_{n=1}^{\infty},\beta\subset \partial E$ and a function $f$, holomorphic on…

We study the Euclidean minimum weight perfect matching problem for $n$ points in the plane. It is known that any deterministic approximation algorithm whose approximation ratio depends only on $n$ requires at least $\Omega(n \log n)$ time.…

We present a detailed investigation of minimum detection efficiencies, below which locality cannot be violated by any quantum system of any dimension in bipartite Bell experiments. Lower bounds on these minimum detection efficiencies are…

We show how to test the bipartiteness of an intersection graph of n line segments or simple polygons in the plane, or of balls in R^d, in time O(n log n). More generally we find subquadratic algorithms for connectivity and bipartiteness…

For any finite number of parts, measurements and outcomes in a Bell scenario we estimate the probability of random $N$-qu$d$it pure states to substantially violate any Bell inequality with uniformly bounded coefficients. We prove that under…

For $\ell\colon \mathbb{R}^d \to [0,\infty)$ we consider the sequence of probability measures $\left(\mu_n\right)_{n \in \mathbb{N}}$, where $\mu_n$ is determined by a density that is proportional to $\exp(-n\ell)$. We allow for infinitely…

We derive a discrete version of the results of our previous work. If $M$ is a compact metric space, $c : M\times M \to \mathbb R$ a continuous cost function and $\lambda \in (0,1)$, the unique solution to the discrete $\lambda$-discounted…

Maximum Mean Discrepancy (MMD) has been widely used in the areas of machine learning and statistics to quantify the distance between two distributions in the $p$-dimensional Euclidean space. The asymptotic property of the sample MMD has…