Related papers: A Lower Bound for the Discrepancy of a Random Poin…

We show that the isotropic discrepancy of a lattice point set can be bounded from below and from above in terms of the spectral test of the corresponding integration lattice. From this we deduce that the isotropic discrepancy of any…

In this manuscript we introduce and study an extended version of the minimal dispersion of point sets, which has recently attracted considerable attention. Given a set $\mathscr P_n=\{x_1,\dots,x_n\}\subset [0,1]^d$ and…

Denote by $K_p(n,k)$ the random subgraph of the usual Kneser graph $K(n,k)$ in which edges appear independently, each with probability $p$. Answering a question of Bollob\'as, Narayanan, and Raigorodskii,we show that there is a fixed $p<1$…

Recent results in quantization theory show that the mean-squared expected distortion can reach a rate of convergence of $\mathcal{O}(1/n)$, where $n$ is the sample size [see, e.g., IEEE Trans. Inform. Theory 60 (2014) 7279-7292 or Electron.…

We extend the proof in [M.~Crouzeix and C.~Palencia, {\em The numerical range is a $(1 + \sqrt{2})$-spectral set}, SIAM Jour.~Matrix Anal.~Appl., 38 (2017), pp.~649-655] to show that other regions in the complex plane are $K$-spectral sets.…

Let $C$ be an $[n,k]$ linear code chosen uniformly at random over a finite field $\mathbb{F}_q$ of size $q$. The following asymptotic probability of $C$ being maximum distance separable (MDS) as $q,n,k\to\infty$ is known: If…

The $k$-center problem is to choose a subset of size $k$ from a set of $n$ points such that the maximum distance from each point to its nearest center is minimized. Let $Q=\{Q_1,\ldots,Q_n\}$ be a set of polygons or segments in the…

The main result of this paper is that for any $1/2 \leq s < 2 - \sqrt{2} \approx 0.5858$, there is a number $\sigma = \sigma(s) < s$ with the following property. Let $\delta > 0$ be small, assume that $A \subset [0,1]$ is a…

We introduce a class of $\gamma$-negatively dependent random samples. We prove that this class includes, apart from Monte Carlo samples, in particular Latin hypercube samples and Latin hypercube samples padded by Monte Carlo. For a…

We study some notions of negative dependence of a sampling scheme that can be used to derive variance bounds for the corresponding estimator or discrepancy bounds for the underlying random point set that are at least as good as the…

We show that in the $K$-sat model with $N$ variables and $\alpha N$ clauses, the expected ratio of the smallest number of unsatisfied clauses to the number of variables is $\alpha/2^K - \sqrt{\alpha} c_*(N)/2^K$ up to smaller order terms…

Let K be a d-dimensional convex body, and let $K^{(n)}$ be the intersection of n halfspaces containing $K$ whose bounding hyperplanes are independent and identically distributed. Under suitable distributional assumptions, we prove an…

We show that with high probability a random set of size $\Theta(n^{1-1/k})$ of $\{1,...,n\}$ contains two elements $a$ and $a+d^k$, where $d$ is a positive integer. As a consequence, we prove an analogue of S\'ark\"ozy-F\"urstenberg's…

We give a simple conceptual proof of the consistency of a test for multivariate uniformity in a bounded set $K \subset \mathbb{R}^d$ that is based on the maximal spacing generated by i.i.d. points $X_1, \ldots,X_n$ in $K$, i.e., the volume…

Star sampling (SS) is a random sampling procedure on a graph wherein each sample consists of a randomly selected vertex (the star center) and its one-hop neighbors (the star endpoints). We consider the use of star sampling to find any…

Let $\Theta^{(n)}$ be a random vector uniformly distributed on the unit sphere $\mathbb S^{n-1}$ in $\mathbb R^n$. Consider the projection of the uniform distribution on the cube $[-1,1]^n$ to the line spanned by $\Theta^{(n)}$. The…

Star sampling (SS) is a random sampling procedure on a graph wherein each sample consists of a randomly selected vertex (the star center) and its (one-hop) neighbors (the star points). We consider the use of SS to find any member of a…

We show that there exists an absolute constant $c_0<1$ such that for all $n \ge 2$, any measurable set $A \subset S^{n-1}$ of density at least $c_0$ contains $n$ pairwise orthogonal vectors. The result is sharp up to the value of the…

We address a question and a conjecture on the expected length of the longest common subsequences of two i.i.d.$\ $random permutations of $[n]:=\{1,2,...,n\}$. The question is resolved by showing that the minimal expectation is not attained…

Let $M$ be an $n\times n$ random matrix with entries in $\{0, 1\}$, where each row is independently and uniformly sampled from the set of all vectors in $\{0, 1\}^n$ containing exactly $d$ ones, with $d=pn$ for some fixed constant $p\in…