English
Related papers

Related papers: A reverse entropy power inequality for i.i.d. log-…

200 papers

Using a sharp version of the reverse Young inequality, and a R\'enyi entropy comparison result due to Fradelizi, Madiman, and Wang, the authors are able to derive R\'enyi entropy power inequalities for log-concave random vectors when…

Information Theory · Computer Science 2018-07-24 Arnaud Marsiglietti , James Melbourne

This note contributes to the understanding of generalized entropy power inequalities. Our main goal is to construct a counter-example regarding monotonicity and entropy comparison of weighted sums of independent identically distributed…

Information Theory · Computer Science 2021-10-20 Mokshay Madiman , Piotr Nayar , Tomasz Tkocz

Building on the recent work of Johnson (2007) and Yu (2008), we prove that entropy is a concave function with respect to the thinning operation T_a. That is, if X and Y are independent random variables on Z_+ with ultra-log-concave…

Information Theory · Computer Science 2009-09-24 Yaming Yu , Oliver Johnson

We prove that the exponent of the entropy of one dimensional projections of a log-concave random vector defines a 1/5-seminorm. We make two conjectures concerning reverse entropy power inequalities in the log-concave setting and discuss…

Probability · Mathematics 2018-01-25 Keith Ball , Piotr Nayar , Tomasz Tkocz

Let $\mathsf{N}_{\rm d}\left[X\right]=\frac{1}{2\pi {\rm e}}{\rm e}^{2\mathsf{H}\left[X\right]}$ denote the entropy power of the discrete random variable $X$ where $\mathsf{H}\left[X\right]$ denotes the discrete entropy of $X$. In this…

Information Theory · Computer Science 2019-05-09 Ehsan Nekouei , Mikael Skoglund , Karl Henrik Johansson

We prove the following type of discrete entropy monotonicity for sums of isotropic, log-concave, independent and identically distributed random vectors $X_1,\dots,X_{n+1}$ on $\mathbb{Z}^d$: $$ H(X_1+\cdots+X_{n+1}) \geq H(X_1+\cdots+X_{n})…

Probability · Mathematics 2025-12-18 Matthieu Fradelizi , Lampros Gavalakis , Martin Rapaport

We compare weighted sums of i.i.d. positive random variables according to the usual stochastic order. The main inequalities are derived using majorization techniques under certain log-concavity assumptions. Specifically, let $Y_i$ be i.i.d.…

Probability · Mathematics 2011-07-19 Yaming Yu

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

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 establish a discrete analog of the R\'enyi entropy comparison due to Bobkov and Madiman. For log-concave variables on the integers, the min entropy is within log e of the usual Shannon entropy. Additionally we investigate the entropic…

Probability · Mathematics 2021-06-01 James Melbourne , Tomasz Tkocz

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

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

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

We show that for log-concave real random variables with fixed variance the Shannon differential entropy is minimized for an exponential random variable. We apply this result to derive upper bounds on capacities of additive noise channels…

Probability · Mathematics 2024-03-19 James Melbourne , Piotr Nayar , Cyril Roberto

We develop an information-theoretic perspective on some questions in convex geometry, providing for instance a new equipartition property for log-concave probability measures, some Gaussian comparison results for log-concave measures, an…

Functional Analysis · Mathematics 2011-03-31 Sergey Bobkov , Mokshay Madiman

We show that for any $\alpha>0$ the R\'enyi entropy of order $\alpha$ is minimized, among all symmetric log-concave random variables with fixed variance, either for a uniform distribution or for a two sided exponential distribution. The…

Information Theory · Computer Science 2021-10-05 Maciej Białobrzeski , Piotr Nayar

We investigate quantitative implications of the notion of log-concavity through a probabilistic interpretation. In particular, we derive concentration inequalities, moment and entropy bounds for random variables satisfying a precise degree…

Probability · Mathematics 2026-02-19 Arnaud Marsiglietti , James Melbourne

We establish a reversal of Lyapunov's inequality for monotone log-concave sequences, settling a conjecture of Havrilla-Tkocz and Melbourne-Tkocz. A strengthened version of the same conjecture is disproved through counter example. We also…

Information Theory · Computer Science 2021-11-16 James Melbourne , Gerardo Palafox-Castillo

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 proven that a conjecture of Tao (2010) holds true for log-concave random variables on the integers: For every $n \geq 1$, if $X_1,\ldots,X_n$ are i.i.d. integer-valued, log-concave random variables, then $$ H(X_1+\cdots+X_{n+1}) \geq…

Probability · Mathematics 2023-10-19 Lampros Gavalakis
‹ Prev 1 2 3 10 Next ›