Related papers: An equivalent conjecture to Feige's Conjecture

The long-standing Gaussian product inequality (GPI) conjecture states that $E [\prod_{j=1}^{n}|X_j|^{\alpha_j}]\geq\prod_{j=1}^{n}E[|X_j|^{\alpha_j}]$ for any centered Gaussian random vector $(X_1,\dots,X_n)$ and any non-negative real…

Let $\mathbb{N}_0$ be a class of natural numbers whose binary decompositions has even number of 1. We estimate of the sum $\sum\limits_{n\in \mathbf{N}_0,n\le X}\exp(2\pi i \alpha n^2)$.

We show that $$ \sum_{n\neq m}\frac{\mu(n)\mu(m)}{nm}E_{X}\left(\{nx\}\{mx\}\right)=-\frac{9}{2\pi^{2}}+O\left(\frac{1}{X}\right), $$ where $x$ is uniformly distributed in $[0,X]$ with $X\in \mathbb{N}$, $E_{X}(.)$ denotes the expected…

Let $X_1, X_2,\ldots, X_n$ be $n$ independent and identically distributed random variables, here $n \geq 2.$ Let $X_{(1)}, X_{(2)}, \ldots, X_{(n)}$ be the order statistics of $X_1, X_2,..., X_n.$ In this note we proved that: (I) If $X_1,…

A collection of $n$ random events is said to be $(n - 1)$-wise independent if any $n - 1$ events among them are mutually independent. We characterise all probability measures with respect to which $n$ random events are $(n - 1)$-wise…

We give exponential upper bounds for $P(S \le k)$, in particular $P(S=0)$, where $S$ is a sum of indicator random variables that are positively associated. These bounds allow, in particular, a comparison with the independent case. We give…

For a word $\pi$ and integer $i$, we define $L^i(\pi)$ to be the length of the longest subsequence of the form $i(i+1)\cdots j$, and we let $L(\pi):=\max_i L^i(\pi)$. In this paper we estimate the expected values of $L^1(\pi)$ and $L(\pi)$…

We study the question, ``For which reals $x$ does there exist a measure $\mu$ such that $x$ is random relative to $\mu$?'' We show that for every nonrecursive $x$, there is a measure which makes $x$ random without concentrating on $x$. We…

Let $X$ be a random variable distributed according to the binomial distribution with parameters $n$ and $p$. It is shown that $P(X>EX)\ge1/4$ if $1>p\ge c/n$, where $c:=\ln(4/3)$, the best possible constant factor.

We consider a number $\nu_n$ of components in a random graph $G(n,p)$ with $n$ vertices, where the probability of an edge is equal to $p$. By operating with special generating functions we shows the next asymptotic relation for factorial…

We give the proof of a tight lower bound on the probability that a binomial random variable exceeds its expected value. The inequality plays an important role in a variety of contexts, including the analysis of relative deviation bounds in…

The extended de Finetti theorem characterizes exchangeable infinite random sequences as conditionally i.i.d. and shows that the apparently weaker distributional symmetry of spreadability is equivalent to exchangeability. Our main result is…

Based on a maximal inequality type result of Cuculescu, we establish some noncommutative maximal inequalities such as Haj\'ek--Penyi inequality and Etemadi inequality. In addition, we present a noncommutative Kolmogorov type inequality by…

Let (X_n) be a sequence of random variables (with values in a separable metric space) and (N_n) a sequence of random indices. Conditions for X_{N_n} to converge stably (in particular, in distribution) are provided. Some examples, where such…

Let $S_n$ be a random walk with i.i.d. increments which have zero mean and finite variance. For every $x\ge0$ we define the stopping time $\tau_x:=\inf\{n\ge1:x+S_n\le0\}$ and consider the probabilities $\mathbb{P}(x+S_n\ge y,\tau_x>n)$. We…

We construct a non - improved exponential bounds for distribution of normed sums of i.,i.d. random variables with random numbers of summand.

Possible parameter values in a random sampling model are shown by definition to have uniform base-rate prior probabilities. This allows a frequentist posterior probability distribution to be calculated for such possible parameter values…

We present an entropy comparison result concerning weighted sums of independent and identically distributed random variables.

We show that if $f$ is the random completely multiplicative function, the probability that $\sum_{n\le x}\frac{f(n)}{n}$ is positive for every $x$ is at least $1-10^{-45}$, while also strictly smaller than $1$. For large $x$, we prove an…

We investigate the approximation for computing the sum $a_1+...+a_n$ with an input of a list of nonnegative elements $a_1,..., a_n$. If all elements are in the range $[0,1]$, there is a randomized algorithm that can compute an…