Related papers: Central Binomial Tail Bounds

In this paper, we consider central complete and incomplete Bell polynomials which are generalizations of the recently introduced central Bell polynomials and central analogues for the complete and incomplete Bell polynomials. We investigate…

This paper addresses the advancement of probability tail bound analysis, a crucial statistical tool for assessing the probability of large deviations of random variables from their expected values. Traditional tail bounds, such as Markov's,…

In this paper, I present a completely new type of upper and lower bounds on the right-tail probabilities of continuous random variables with unbounded support and with semi-bounded support from the left. The presented upper and lower…

A new class of alternating convolutions concerning binomial coefficients and Catalan numbers are evaluated in closed forms.

We study generalisations of a simple, combinatorial proof of a Chernoff bound similar to the one by Impagliazzo and Kabanets (RANDOM, 2010). In particular, we prove a randomized version of the hitting property of expander random walks and…

We study the Central Limit Theorem (CLT) in the so-called hybrid Lebesgue-continuous spaces and tail behavior of normed sums of centered random independent variables (vectors) with values in these spaces.

Recently, the properties of a binomial sum related to the multi-link inverted pendulum enumeration problem have been studied. In this note, we establish bounds for this binomial sum.

We establish an upper bound on the tails of a random variable that arises as a solution of a stochastic difference equation. In the non--negative case our bound is similar to a lower bound obtained by Goldie and Gr\"ubel in 1996.

Using terminologies of information geometry, we derive upper and lower bounds of the tail probability of the sample mean. Employing these bounds, we obtain upper and lower bounds of the minimum error probability of the 2nd kind of error…

In this paper we consider the notions of binomial thinning, binomial mixing, their generalizations, certain interplay between them, associated limit theorems and provide various examples.

We derive new bounds of the remainder in a combinatorial central limit theorem without assumptions on independence and existence of moments of summands. For independent random variables our theorems imply Esseen and Berry-Esseen type…

We study the upper tail of the number of arithmetic progressions of a given length in a random subset of {1,...,n}, establishing exponential bounds which are best possible up to constant factors in the exponent. The proof also extends to…

In 1992, Kalai and Kleitman proved a quasipolynomial upper bound on the diameters of convex polyhedra. Todd and Sukegawa-Kitahara proved tail-quasipolynomial bounds on the diameters of polyhedra. These tail bounds apply when the number of…

We study the bias of random bounded-degree polynomials over odd prime fields and show that, with probability exponentially close to 1, such polynomials have exponentially small bias. This also yields an exponential tail bound on the weight…

We prove a central limit theorem for the length of the longest subsequence of a random permutation which follows one of a class of repeating patterns. This class includes every fixed pattern of ups and downs having at least one of each,…

Derandomization of Chernoff bound with union bound is already proven in many papers. We here give another explicit version of it that obtains a construction of size that is arbitrary close to the probabilistic nonconstructive size. We apply…

We prove a lower bound on the canonical height associated to polynomials over number fields evaluated at points with infinite forward orbit. The lower bound depends only on the degree of the polynomial, the degree of the number field, and…

Let $P$ be a polynomial of degree $d$ in independent Bernoulli random variables which has zero mean and unit variance. The Bonami hypercontractivity bound implies that the probability that $|P| > t$ decays exponentially in $t^{2/d}$.…

We generalize the shadow codes of Cherubini and Micheli to include basic polynomials having arbitrary degree, and show that restricting basic polynomials to have degree one or less can result in improved lower bounds on the minimum distance…

Let $(\tau_n)$ be a sequence of toral automorphisms $\tau_n : x \rightarrow A_n x \hbox{mod}\ZZ^d$ with $A_n \in {\cal A}$, where ${\cal A}$ is a finite set of matrices in $SL(d, \mathbb{Z})$. Under some conditions the method of…