Related papers: Lower bounds for tails of sums of independent symm…

The paper suggests a simple method of deriving minimax lower bounds to the accuracy of statistical inference on heavy tails. A well-known result by Hall and Welsh (Ann. Statist. 12 (1984) 1079-1084) states that if $\hat{\alpha}_n$ is an…

For a random variable $X$ define $Q(X) = \sup_{x \in \mathbb{R}} \mathbb{P}(X=x)$. Let $X_1, \dots, X_n$ be independent integer random variables. Suppose $Q(X_i) \le \alpha_i \in (0,1]$ for each $i \in \{1, \dots, n\}$. Ju\v{s}kevi\v{c}ius…

We consider the least singular value of a large random matrix with real or complex i.i.d. Gaussian entries shifted by a constant $z\in\mathbb{C}$. We prove an optimal lower tail estimate on this singular value in the critical regime where…

Under the assumption that the distribution of a nonnegative random variable $X$ admits a bounded coupling with its size biased version, we prove simple and strong concentration bounds. In particular the upper tail probability is shown to…

We re-examine a lower-tail upper bound for the random variable $$X=\prod_{i=1}^{\infty}\min\left\{\sum_{k=1}^iE_k,1\right\},$$ where $E_1,E_2,\ldots\stackrel{iid}\sim\text{Exp}(1)$. This bound has found use in root-finding and seed-finding…

Lattice results, kinematical constraints and QCD dispersion relations are combined for the first time to derive model-independent bounds for QCD form factors and corresponding rates. To take into account the error bars on the lattice…

We obtain decay rates of probabilities of tails of polynomials in several independent random variables with heavy tails and derive stable limit theorems for nonconventional sums of such polynomials

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…

We derive two upper bounds for the probability of deviation of a vector-valued Lipschitz function of a collection of random variables from its expected value. The resulting upper bounds can be tighter than bounds obtained by a direct…

In the context of bounding probability of small deviation, there are limited general tools. However, such bounds have been widely applied in graph theory and inventory management. We introduce a common approach to substantially sharpen such…

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 find the exact values for constants in bilateral Calderon-Stein-Weiss inequalities between tail (Marcinkiewicz) norm and weak Lebesgue (Lorentz) norm. Possible applications: Functional Analysis (for instance, interpolation of operators),…

Using a recent improvement by Bettin and Chandee to a bound of Duke, Friedlander and Iwaniec~(1997) on double exponential sums with Kloosterman fractions, we establish a uniformity of distribution result for the fractional parts of Dedekind…

Let $M_n$ denote a random symmetric $n \times n$ matrix whose upper diagonal entries are independent and identically distributed Bernoulli random variables (which take values $1$ and $-1$ with probability $1/2$ each). It is widely…

The probability that the sum of independent, centered, identically distributed, heavy-tailed random variables achieves a very large value is asymptotically equal to the probability that there exists a single summand equalling that value. We…

In this paper, we present a new framework to obtain tail inequalities for sums of random matrices. Compared with existing works, our tail inequalities have the following characteristics: 1) high feasibility--they can be used to study the…

A lower bound on the R\'enyi differential entropy of a sum of independent random vectors is demonstrated in terms of rearrangements. For the special case of Boltzmann-Shannon entropy, this lower bound is better than that given by the…

Conditional on the extended Riemann hypothesis, we show that with high probability, the characteristic polynomial of a random symmetric $\{\pm 1\}$-matrix is irreducible. This addresses a question raised by Eberhard in recent work. The main…

In their seminal 1990 paper, Wasserman and Kadane establish an upper bound for the Bayes' posterior probability of a measurable set $A$, when the prior lies in a class of probability measures $\mathcal{P}$ and the likelihood is precise.…

We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…