English
Related papers

Related papers: An Entropy Power Inequality for Discrete Random Va…

200 papers

The entropy power inequality (EPI) provides lower bounds on the differential entropy of the sum of two independent real-valued random variables in terms of the individual entropies. Versions of the EPI for discrete random variables have…

Information Theory · Computer Science 2013-01-18 Saeid Haghighatshoar , Emmanuel Abbe , Emre Telatar

We consider the entropy of sums of independent discrete random variables, in analogy with Shannon's Entropy Power Inequality, where equality holds for normals. In our case, infinite divisibility suggests that equality should hold for…

Information Theory · Computer Science 2010-10-21 Oliver Johnson , Yaming Yu

It is known that the Entropy Power Inequality (EPI) always holds if the random variables have density. Not much work has been done to identify discrete distributions for which the inequality holds with the differential entropy replaced by…

Information Theory · Computer Science 2012-05-22 Naresh Sharma , Smarajit Das , Siddharth Muthukrishnan

It is well known that the entropy $H(X)$ of a discrete random variable $X$ is always greater than or equal to the entropy $H(f(X))$ of a function $f$ of $X$, with equality if and only if $f$ is one-to-one. In this paper, we give tight…

Information Theory · Computer Science 2017-12-22 Ferdinando Cicalese , Luisa Gargano , Ugo Vaccaro

An extension of the entropy power inequality to the form $N_r^\alpha(X+Y) \geq N_r^\alpha(X) + N_r^\alpha(Y)$ with arbitrary independent summands $X$ and $Y$ in $\mathbb{R}^n$ is obtained for the R\'enyi entropy and powers $\alpha \geq…

Information Theory · Computer Science 2017-10-25 Sergey Bobkov , Arnaud Marsiglietti

When two independent analog signals, X and Y are added together giving Z=X+Y, the entropy of Z, H(Z), is not a simple function of the entropies H(X) and H(Y), but rather depends on the details of X and Y's distributions. Nevertheless, the…

Quantum Physics · Physics 2014-02-21 Robert Koenig , Graeme Smith

Many partially-successful attempts have been made to find the most natural discrete-variable version of Shannon's entropy power inequality (EPI). We develop an axiomatic framework from which we deduce the natural form of a discrete-variable…

Information Theory · Computer Science 2016-11-17 Saikat Guha , Jeffrey H. Shapiro , Raul Garcia-Patron Sanchez

The entropy power inequality for independent random vectors is a foundational result of information theory, with deep connections to probability and geometric functional analysis. Several extensions of the entropy power inequality have been…

Information Theory · Computer Science 2025-12-23 Mokshay Madiman , James Melbourne , Cyril Roberto

Yet another simple proof of the entropy power inequality is given, which avoids both the integration over a path of Gaussian perturbation and the use of Young's inequality with sharp constant or R\'enyi entropies. The proof is based on a…

Information Theory · Computer Science 2017-02-22 Olivier Rioul

We show that there is equality in Shannon's Entropy Power Inequality (EPI) if and only if the random variables involved are Gaussian, assuming nothing beyond the existence of differential entropies. This is done by justifying de Bruijn's…

Probability · Mathematics 2025-09-30 Lampros Gavalakis , Ioannis Kontoyiannis

The variance and the entropy power of a continuous random variable are bounded from below by the reciprocal of its Fisher information through the Cram\'{e}r-Rao bound and the Stam's inequality respectively. In this note, we introduce the…

Statistics Theory · Mathematics 2019-05-21 Tomohiro Nishiyama

We show that $h_\infty(X+Y)\leq h_\infty(Z+W)$, where $X, Y$ are independent log-concave random variables, and $Z, W$ are exponential random variables having the same respective $\infty$-R\'enyi entropies. Analogs for integer-valued…

Probability · Mathematics 2025-11-03 Zhen Fu , Jiange Li

This paper gives improved R\'{e}nyi entropy power inequalities (R-EPIs). Consider a sum $S_n = \sum_{k=1}^n X_k$ of $n$ independent continuous random vectors taking values on $\mathbb{R}^d$, and let $\alpha \in [1, \infty]$. An R-EPI…

Information Theory · Computer Science 2016-07-21 Eshed Ram , Igal Sason

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…

Information Theory · Computer Science 2025-08-08 Riccardo Castellano , Pavel Sekatski

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$,…

Discrete Mathematics · Computer Science 2022-04-05 Dmytro Gavinsky , Pavel Pudlák

Shannon's Entropy Power Inequality can be viewed as characterizing the minimum differential entropy achievable by the sum of two independent random variables with fixed differential entropies. The entropy power inequality has played a key…

Information Theory · Computer Science 2012-07-31 Varun Jog , Venkat Anantharam

Following a growing number of studies that, over the past 15 years, have established entropy inequalities via ideas and tools from additive combinatorics, in this work we obtain a number of new bounds for the differential entropy of sums,…

Information Theory · Computer Science 2025-11-20 Rupert Li , Lampros Gavalakis , Ioannis Kontoyiannis

Expressions for (EPI Shannon type) Divergence-Power Inequalities (DPI) in two cases (time-discrete and band-limited time-continuous) of stationary random processes are given. The new expressions connect the divergence rate of the sum of…

Information Theory · Computer Science 2016-11-17 Jacob Binia

We utilize a discrete version of the notion of degree of freedom to prove a sharp min-entropy-variance inequality for integer valued log-concave random variables. More specifically, we show that the geometric distribution minimizes the…

Probability · Mathematics 2023-09-08 Heshan Aravinda

It is well known that the entropy $H(X)$ of a finite random variable is always greater or equal to the entropy $H(f(X))$ of a function $f$ of $X$, with equality if and only if $f$ is one-to-one. In this paper, we give tights bounds on…

Information Theory · Computer Science 2017-04-25 Ferdinando Cicalese , Luisa Gargano , Ugo Vaccaro
‹ Prev 1 2 3 10 Next ›