Related papers: On Sums of Monotone Random Integer Variables

We consider random graphs in which the edges are allowed to be dependent. In our model the edge dependence is quite general, we call it $p$-robust random graph. It means that every edge is present with probability at least $p$, regardless…

We consider the probability that a weighted sum of $n$ i.i.d. random variables $X_j$, $j = 1, . . ., n$, with stretched exponential tails is larger than its expectation and determine the rate of its decay, under suitable conditions on the…

The (general) hypoexponential distribution is the distribution of a sum of independent exponential random variables. We consider the particular case when the involved exponential variables have distinct rate parameters. We prove that the…

In this paper, we study the summability properties of double sequences of real constants which map sequences of random variables to sequences of random variables that are defined on the same probability sample space. We show that a regular…

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…

We have discussed earlier the correlation functions of the random variables $\det(\la-X)$ in which $X$ is a random matrix. In particular the moments of the distribution of these random variables are universal functions, when measured in the…

We prove that if a rectangular matrix with uniformly small entries and approximately orthogonal rows is applied to the independent standardized random variables with uniformly bounded third moments, then the empirical CDF of the resulting…

In this paper, we study the fluctuations of sums of random variables with distribution defined as a mixture of light-tail and truncated heavy-tail distributions. We focus on the case when both the mixing coefficient and the truncation level…

Motivated by a question of Krzysztof Oleszkiewicz we study a notion of weak tail domination of random vectors. We show that if the dominating random variable is sufficiently regular weak tail domination implies strong tail domination. In…

Scale invariant scattering suggests that all Bernoulli numbers B_{2n} can be naturally partitioned, i.e., written as particular finite sums of same-signed, monotonic, rational numbers. Some properties of these rational numbers are discussed…

How low can the joint entropy of $n$ $d$-wise independent (for $d\ge2$) discrete random variables be, subject to given constraints on the individual distributions (say, no value may be taken by a variable with probability greater than $p$,…

Let X1, ..., Xn be arbitrary non-negative independent random variables with respective expected values $\mu_{i}$ at most one. We sketch but do not prove an equivalent conjecture to Feige's Conjecture $\mathbb{P} \left( \sum_{i=1}^{n} X_{i}…

In this work we investigate the asymptotic behaviour of weighted partial sums of a particular class of random variables related to Oppenheim series expansions. More precisely, we verify convergence in probability as well as almost sure…

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…

Let $X_1,X_2,...$ be the digits in the base-$q$ expansion of a random variable $X$ defined on $[0,1)$ where $q\ge2$ is an integer. For $n=1,2,...$, we study the probability distribution $P_n$ of the (scaled) remainder…

We characterize some major algorithmic randomness notions via differentiability of effective functions. (1) As the main result we show that a real number z in [0,1] is computably random if and only if each nondecreasing computable function…

In contrast to that a weak value of an observable is usually divided into real and imaginary parts, here we show that separation into modulus and argument is important for modular values. We first show that modular values are expressed by…

We study the singularity probability of random integer matrices. Concretely, the probability that a random $n \times n$ matrix, with integer entries chosen uniformly from $\{-m,\ldots,m\}$, is singular. This problem has been well studied in…

We show that $z\in\R^n$ is computably random if and only if every computable monotone function on $\R^n$ is differentiable at $z$.

We derive an asymptotic lower bound on the Shannon entropy $H$ of sums of $N$ arbitrary iid discrete random variables. The derived bound $H \geq \frac{r(X)}{2}\log(N) + {\it cst}$ is given in terms of the incommensurability rank $r(X)$ of…