Related papers: Sharp and Simple Bounds for the raw Moments of the…

Denote by $p(k)$ the limit, as $n \rightarrow \infty$, of the probability that a random permutation on a set of size $n$ has an invariant set of size $k$. We give an asymptotic formula for $p(k)$, showing that it is asymptotically…

We improve the upper bound for diagonal Ramsey numbers to \[R(k+1,k+1)\le\exp(-c(\log k)^2)\binom{2k}{k}\] for $k\ge 3$. To do so, we build on a quasirandomness and induction framework for Ramsey numbers introduced by Thomason and extended…

Let $N_\lambda$ and $U$ be two independent random variables respectively distributed as a Poisson distribution with parameter $\lambda >0$ and a uniform distribution on $(0,1)$. This paper establishes that the median, say $M$, of…

In this note we present an algorithm to obtain a uniform lower bound on Hausdorff dimension of the stationary measure of an affine iterated function scheme with similarities, the best known example of which is Bernoulli convolution. The…

We introduce and study the notion of k-divisible elements in a non-commutative probability space. A k-divisible element is a (non-commutative) random variable whose n-th moment vanishes whenever n is not a multiple of k. First, we consider…

In this work we give an efficient construction of unitary $k$-designs using $\tilde{O}(k\cdot poly(n))$ quantum gates, as well as an efficient construction of a parallel-secure pseudorandom unitary (PRU). Both results are obtained by giving…

We study sums of independent random variables that take values $0$, $1/2$, or $1$. We show that the probability mass function of the sum splits into two interleaved parts: one supported on the integers and the other supported on the…

Using techniques from Poisson approximation, we prove explicit error bounds on the number of permutations that avoid any pattern. Most generally, we bound the total variation distance between the joint distribution of pattern occurrences…

We show the existence of systems of n polynomial equations in n variables, with a total of n+k+1 distinct monomial terms, possessing [n/k+1]^k nondegenerate positive solutions. (Here, [x] is the integer part of a positive number x.) This…

For a sequence $\{X_{n}, \, n \geqslant 1 \}$ of nonnegative random variables where $\max[\min(X_{n} - s,t),0]$, $t > s \geqslant 0$, satisfy a moment inequality, sufficient conditions are given under which $\sum_{k=1}^n (X_k - \mathbb{E}…

Let $\BS_1,...,\BS_n$ be independent identically distributed random variables each having the standardized Bernoulli distribution with parameter $p\in(0,1)$. Let $m_*(p):=(1+p+2p^2)/(2\sqrt{p-p^2}+4p^2)$ if $0<p\le 1/2$ and $m_*(p):=1$ if…

For a fixed unit vector a=(a_1,a_2,...,a_n) in S^{n-1}, i.e. sum_{i=1}^n a_i^2=1, we consider the 2^n sign vectors epsilon=(epsilon_1,epsilon_2,...,epsilon_n) in {-1,1}^n and the corresponding scalar products a.epsilon=sum_{i=1}^n a_i…

This paper develops sharp bounds on moments of sums of k-wise independent bounded random variables, under constrained average variance. The result closes the problem addressed in part in the previous works of Schmidt et al. and Bellare,…

Suppose that i.i.d. random variables $X_{1}, X_{2}, \ldots$ are chosen uniformly from $[0,1]$, and let $f: [0,1] \rightarrow [0,1]$ be an increasing bijection. Define $\mu_{f}$ to be the expected value of $f(X_{i})$ for each $i$. Define the…

Despite the relevance of the binomial distribution for probability theory and applied statistical inference, its higher-order moments are poorly understood. The existing formulas are either not general enough, or not structured and…

The Conway-Maxwell-Poisson distribution is a two-parameter generalisation of the Poisson distribution that can be used to model data that is under- or over-dispersed relative to the Poisson distribution. The normalizing constant…

The bounds for absolute moments of order statistics are established. Let $X_1,\dots ,X_n$ be independent identically distributed real-valued random variables and let $X_{1:n}\le \dots \le X_{n:n}$ be the corresponding order statistics. The…

For $G=G_{n, 1/2}$, the Erd\H{o}s--Renyi random graph, let $X_n$ be the random variable representing the number of distinct partitions of $V(G)$ into sets $A_1, \ldots, A_q$ so that the degree of each vertex in $G[A_i]$ is divisible by $q$…

The classical Poisson theorem says that if $\xi_1,\xi_2,...$ are i.i.d. 0--1 Bernoulli random variables taking on 1 with probability $p_n\equiv \la/n$ then the sum $S_n=\sum_{i=1}^n\xi_i$ is asymptotically in $n$ Poisson distributed with…

Motivated by real-world machine learning applications, we analyze approximations to the non-asymptotic fundamental limits of statistical classification. In the binary version of this problem, given two training sequences generated according…