相关论文: Anticoncentration of Random Sums in $\mathbb{Z}_p$

The classic problems of testing uniformity of and learning a discrete distribution, given access to independent samples from it, are examined under general $\ell_p$ metrics. The intuitions and results often contrast with the classic…

We study the relative entropy between the empirical estimate of a discrete distribution and the true underlying distribution. If the minimum value of the probability mass function exceeds an $\alpha > 0$ (i.e. when the true underlying…

TO BE PUBLISHED BY ISRAEL JOURNAL OF MATHEMATICS. We study the mean $\sum_{x\in\mathcal{X}} \bigl|\sum_{p\le N}{}u_p e(xp)\bigr|^{\ell}$ when $\ell$ covers the full range $[2,\infty)$ and $\mathcal{X}\subset\mathbb{R}/\mathbb{Z}$ is a…

In this paper we study the behaviour of the domination number of the Erd\H{o}s-R\'enyi random graph $\mathcal{G}(n,p)$. Extending a result of Wieland and Godbole we show that the domination number of $\mathcal{G}(n,p)$ is equal to one of…

Many axiomatic definitions of entropy, such as the R\'enyi entropy, of a random variable are closely related to the $\ell_{\alpha}$-norm of its probability distribution. This study considers probability distributions on finite sets, and…

We study p-adic counterparts of stable distributions, that is limit distributions for sequences of normalized sums of independent identically distributed p-adic-valued random variables. In contrast to the classical case, non-degenerate…

We revisit the problem of condensation for independent, identically distributed random variables with a power-law tail, conditioned by the value of their sum. For large values of the sum, and for a large number of summands, a condensation…

We prove anti-concentration bounds for the inner product of two independent random vectors. For example, we show that if $A,B$ are subsets of the cube $\{\pm 1\}^n$ with $|A| \cdot |B| \geq 2^{1.01 n}$, and $X \in A$ and $Y \in B$ are…

The Littlewood-Offord problem is a classical question in probability theory and discrete mathematics, proposed, firstly by Littlewood and Offord in the 1940s. Given a set $A$ of integer, this problem asks for an upper bound on the…

It is shown that, for any given $p\ge5$, $A>0$ and $B>0$, the exact upper bound on $\mathsf{E}|\sum X_i|^p$ over all independent zero-mean random variables (r.v.'s) $X_1,\ldots,X_n$ such that $\sum\mathsf{E}X_i^2=B$ and…

We present novel bounds for estimating discrete probability distributions under the $\ell_\infty$ norm. These are nearly optimal in various precise senses, including a kind of instance-optimality. Our data-dependent convergence guarantees…

Sharp, nonasymptotic bounds are obtained for the relative entropy between the distributions of sampling with and without replacement from an urn with balls of $c\geq 2$ colors. Our bounds are asymptotically tight in certain regimes and,…

The $p$-set, which is in a simple analytic form, is well distributed in unit cubes. The well-known Weil's exponential sum theorem presents an upper bound of the exponential sum over the $p$-set. Based on the result, one shows that the…

We examine sets $\mathscr A$ of natural numbers having the property that for some real number $p\in (0,2)$, one has the subconvex bound $$\int_0^1 \Bigl| \sum_{n\in \mathscr A\cap [1,N]}e(n\alpha)\Bigr|^p\, {\rm d}\alpha \ll N^{-1}|\mathscr…

We study the problem of generalized uniformity testing \cite{BC17} of a discrete probability distribution: Given samples from a probability distribution $p$ over an {\em unknown} discrete domain $\mathbf{\Omega}$, we want to distinguish,…

We present examples of $p$-sub-exponential random variables for any positive $p$. We prove two types of concentration of standard $p$-norms ($2$-norm is the Euclidean norm) of random vectors with independent $p$-sub-exponential coordinates…

In [18] we have shown that, for $p_{1},p_{2}\in(2,\infty]$, the constants of Bennett's inequality on unimodular bilinear forms on $\ell_{p_{1}}^{n_{1} }\times\ell_{p_{2}}^{n_{2}}$ are asymptotically bounded by $1$. In the present paper we…

We prove anti-concentration bounds for the inner product of two independent random vectors, and use these bounds to prove lower bounds in communication complexity. We show that if $A,B$ are subsets of the cube $\{\pm 1\}^n$ with $|A| \cdot…

We study the asymptotic distribution of the number of matchings of size $\ell=\ell(n)$ in $G(n,p)$ for a wide range of $p=p(n)\in (0,1)$ and for every $1\le \ell\le \lfloor n/2\rfloor$. We prove that this distribution changes from normal to…

We study the problem of testing \emph{conditional independence} for discrete distributions. Specifically, given samples from a discrete random variable $(X, Y, Z)$ on domain $[\ell_1]\times[\ell_2] \times [n]$, we want to distinguish, with…