Related papers: On Sums of Monotone Random Integer Variables
In this paper, we concentrate on counting and testing dominant polynomials with integer coefficients. A polynomial is called dominant if it has a simple root whose modulus is strictly greater than the moduli of its remaining roots. In…
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…
We prove that variances of non-negative random variables have the following monotonicity property: For all $0 < r < s \le 1$, and all $0 \le X \in L^2$, we have $\operatorname{Var}(X^r)^{1/r} \le \operatorname{Var}(X^s)^{1/s}$. We also…
The ratio $P(S_n=x)/P(Z_n=x)$ is investigated for three cases: (a) when $S_n$ is a sum of 1-dependent non-negative integer-valued random variables (rvs), satisfying some moment conditions, and $Z_n$ is Poisson rv; (b) when $S_n$ is a…
A perturbative approach is used to derive approximations of arbitrary order to estimate high percentiles of sums of positive independent random variables that exhibit heavy tails. Closed-form expressions for the successive approximations…
Let $b(x)$ be the probability that a sum of independent Bernoulli random variables with parameters $p_1, p_2, p_3, \ldots \in [0,1)$ equals $x$, where $\lambda := p_1 + p_2 + p_3 + \cdots$ is finite. We prove two inequalities for the…
Let $\eta_{1},\eta_2,...$ be independent (not necessarily identically distributed) zero-mean random variables (r.v.'s) such that $|\eta_i|\le1$ almost surely for all $i$, and let $Z$ stand for a standard normal r.v. Let $a_1,a_2,...$ be any…
Entropy and differential entropy are important quantities in information theory. A tractable extension to singular random variables-which are neither discrete nor continuous-has not been available so far. Here, we present such an extension…
We obtain concentration and large deviation for the sums of independent and identically distributed random variables with heavy-tailed distributions. Our concentration results are concerned with random variables whose distributions satisfy…
We show that a family of random variables is uniformly integrable if and only if it is stochastically bounded in the increasing convex order by an integrable random variable. This result is complemented by proving analogous statements for…
We give explicit bounds for the tail probabilities for sums of independent geometric or exponential variables, possibly with different parameters.
The classical random matrix theory is mostly focused on asymptotic spectral properties of random matrices as their dimensions grow to infinity. At the same time many recent applications from convex geometry to functional analysis to…
We introduce new method for generating correlated or uncorrelated Bernoulli random variables by using the binary expansion of a continuous random variable with support on the unit interval. We show that when this variable has a symmetric…
If two random variables X and A are functionally related via f(X)=A for some strictly monotone continuously differentiable function f:R->R, the distribution of X may easily be computed from the distribution of A.
Several proofs of the monotonicity of the non-Gaussianness (divergence with respect to a Gaussian random variable with identical second order statistics) of the sum of n independent and identically distributed (i.i.d.) random variables were…
The expectation is an example of a descriptive statistic that is monotone with respect to stochastic dominance, and additive for sums of independent random variables. We provide a complete characterization of such statistics, and explore a…
We consider a notion of uniform thinning for a finite sequence of random variables $(X_1,...,X_n)$ obtained by removing one random variable, uniformly at random. If a triangular array of random variables $(X_{n,k} : n \in \mathbb{N}_+, 1…
We develop an efficient simulation algorithm for computing the tail probabilities of the infinite series $S = \sum_{n \geq 1} a_n X_n$ when random variables $X_n$ are heavy-tailed. As $S$ is the sum of infinitely many random variables, any…
Evaluating joint probabilities of potential outcomes and observed variables, and their linear combinations, is a fundamental challenge in causal inference. This paper addresses the bounding and identification of these probabilities in…
Let X_1,...., X_n be a collection of iid discrete random variables, and Y_1,..., Y_m a set of noisy observations of such variables. Assume each observation Y_a to be a random function of some a random subset of the X_i's, and consider the…