Related papers: Bounded size bias coupling: a Gamma function bound…

This paper focuses on the size-biased permutation of $n$ independent and identically distributed (i.i.d.) positive random variables. This is a finite dimensional analogue of the size-biased permutation of ranked jumps of a subordinator…

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…

In this note we establish a uniform bound for the distribution of a sum $S_n=X_1+\cdots+X_n$ of independent non-homogeneous Bernoulli trials. Specifically, we prove that $\sigma_n \mathbb{P}(S_n\!=\!j)\leq\eta$ where $\sigma_n$ denotes the…

In this paper we revisited the classical problem of max-sum equivalence of randomly weighted sums in two dimensions. In opposite to the most papers in literature, we consider that there exists some interdependence between the primary random…

We provide finite-sample distribution approximations, that are uniform in the parameter, for inference in linear mixed models. Focus is on variances and covariances of random effects in cases where existing theory fails because their…

We characterize the power of constant-depth Boolean circuits in generating uniform symmetric distributions. Let $f\colon\{0,1\}^m\to\{0,1\}^n$ be a Boolean function where each output bit of $f$ depends only on $O(1)$ input bits. Assume the…

The Shapley-Folkman theorem shows that Minkowski averages of uniformly bounded sets tend to be convex when the number of terms in the sum becomes much larger than the ambient dimension. In optimization, Aubin and Ekeland [1976] show that…

The non-asymptotic tail bounds of random variables play crucial roles in probability, statistics, and machine learning. Despite much success in developing upper bounds on tail probability in literature, the lower bounds on tail…

The asymptotic tail behaviour of sums of independent subexponential random variables is well understood, one of the main characteristics being the principle of the single big jump. We study the case of dependent subexponential random…

Estimates are constructed for the deviation of the concentration functions of sums of independent random variables with finite variances from the folded normal distribution function without any assumptions concerning the existence of the…

Concentration inequalities are fundamental tools in probabilistic combinatorics and theoretical computer science for proving that random functions are near their means. Of particular importance is the case where f(X) is a function of…

We prove that the tail probabilities of sums of independent uniform random variables, up to a multiplicative constant, are dominated by the Gaussian tail with matching variance and find the sharp constant for such stochastic domination.

We establish Hoeffding-type concentration inequalities for the low and high tail bounds of sums of exchangeable random variables. Our results exhibit an anti-symmetry in such tail bounds due to the assumption of exchangeability, a…

An explicit upper bound on the tail probabilities for the normalized Rademacher sums is given. This bound, which is best possible in a certain sense, is asymptotically equivalent to the corresponding tail probability of the standard normal…

Around 2008, Schramm conjectured that the critical probabilities for Bernoulli bond percolation satisfy the following continuity property: If $(G_n)_{n\geq 1}$ is a sequence of transitive graphs converging locally to a transitive graph $G$…

This paper describes the quality of convergence to an infinitely divisible law relative to free multiplicative convolution. We show that convergence in distribution for products of identically distributed and infinitesimal free random…

We provide sufficient density condition for a set of nonuniform samples to give rise to a set of sampling for multivariate bandlimited functions when the measurements consist of pointwise evaluations of a function and its first $k$…

We provide a systematic approach to deal with the following problem. Let $X_1,\ldots,X_n$ be, possibly dependent, $[0,1]$-valued random variables. What is a sharp upper bound on the probability that their sum is significantly larger than…

While useful probability bounds for $n$ pairwise independent Bernoulli random variables adding up to at least an integer $k$ have been proposed in the literature, none of these bounds are tight in general. In this paper, we provide several…

We present new sampling methods in finite population that allow to control the joint inclusion probabilities of units and especially the spreading of sampled units in the population. They are based on the use of renewal chains and…