Related papers: On closeness to k-wise uniformity

A common way to discretize a probability measure is to use an empirical measure as a discrete approximation. But how far from being optimal is this approximation in the p-Wasserstein distance? In this paper, we study this question in two…

Uniformity testing is arguably one of the most fundamental distribution testing problems. Given sample access to an unknown distribution $\mathbf{p}$ on $[n]$, one must decide if $\mathbf{p}$ is uniform or $\varepsilon$-far from uniform (in…

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…

It has long been known, since the classical work of (Arora, Karger, Karpinski, JCSS~99), that \MC\ admits a PTAS on dense graphs, and more generally, \kCSP\ admits a PTAS on "dense" instances with $\Omega(n^k)$ constraints. In this paper we…

We consider a random symmetric matrix ${\bf X} = [X_{jk}]_{j,k=1}^n$ with upper triangular entries being i.i.d. random variables with mean zero and unit variance. We additionally suppose that $\mathbb E |X_{11}|^{4 + \delta} =:…

We study the empirical spectral distribution (ESD) for complex n x n matrix polynomials of degree k. We obtain exact formulae for the almost sure limit of the ESD in two distinct scenarios: (1) n -> \infty with k constant and (2) k ->…

We show that if $(X, \mu, T)$ is a probability measure-preserving dynamical system, and $\mathscr{P}$ is a countable partition of $(X, \mu)$, then the limit $$ \lim_{n, k \to \infty} \mathbb{E} \left[ \frac{1}{k} \sum_{j = 0}^{k - 1} f…

First, let $K \subset B(0,1) \subset \mathbb{R}^{2}$ be a set with $\mathcal{H}_{\infty}^{1}(K) \sim 1$, and write $\pi_{e}(K)$ for the orthogonal projection of $K$ into the line spanned by $e \in S^{1}$. For $1/2 \leq s < 1$, write $$E_{s}…

A bound for functional $\Delta(F)=\sup_{x\in\mathbb R}|F(x)-\Phi(x)|$ is obtained, which is uniform for all distribution functions $F$ of random variables with zero mean-value and unity variance. Moreover, a two-point distribution is found,…

We study the following distribution clustering problem: Given a hidden partition of $k$ distributions into two groups, such that the distributions within each group are the same, and the two distributions associated with the two clusters…

A k-wise independent distribution on n bits is a joint distribution of the bits such that each k of them are independent. In this paper we consider k-wise independent distributions with identical marginals, each bit has probability p to be…

Given a set $P$ of $n$ points in $\mathbf{R}^d$, and a positive integer $k \leq n$, the $k$-dispersion problem is that of selecting $k$ of the given points so that the minimum inter-point distance among them is maximized (under Euclidean…

We study the power of uniform sampling for $k$-Median in various metric spaces. We relate the query complexity for approximating $k$-Median, to a key parameter of the dataset, called the balancedness $\beta \in (0, 1]$ (with $1$ being…

For given integers $k$ and $\ell$ with $0<\ell< {k \choose 2}$, Alon, Hefetz, Krivelevich and Tyomkyn formulated the following conjecture: When sampling a $k$-vertex subset uniformly at random from a very large graph $G$, then the…

In this paper we consider the problem of uniformity testing with limited memory. We observe a sequence of independent identically distributed random variables drawn from a distribution $p$ over $[n]$, which is either uniform or is…

Let $M_n^{(k)}$ denote the $k$th largest maximum of a sample $(X_1,X_2,...,X_n)$ from parent $X$ with continuous distribution. Assume there exist normalizing constants $a_n>0$, $b_n\in \mathbb{R}$ and a nondegenerate distribution $G$ such…

The matrix $A:\mathbb{R}^n \to \mathbb{R}^m$ is $(\delta,k)$-regular if for any $k$-sparse vector $x$, $$ \left| \|Ax\|_2^2-\|x\|_2^2\right| \leq \delta \sqrt{k} \|x\|_2^2. $$ We show that if $A$ is $(\delta,k)$-regular for $1 \leq k \leq…

Let $K(=K_{n,\theta})$ be a positive integer-valued random variable whose distribution is given by ${\rm P}(K = x) = \bar{s}(n,x) \theta^x/(\theta)_n$ $(x=1,\ldots,n) $, where $\theta$ is a positive number, $n$ is a positive integer,…

The $2$-Wasserstein distance is sensitive to minor geometric differences between distributions, making it a very powerful dissimilarity metric. However, due to this sensitivity, a small outlier mass can also cause a significant increase in…

A random k-out mapping (digraph) on [n] is generated by choosing k random images of each vertex one at a time, subject to a "preferential attachment" rule: the current vertex selects an image i with probability proportional to a given…