English
Related papers

Related papers: On the problem of reversibility of the entropy pow…

200 papers

A lower bound on the R\'enyi differential entropy of a sum of independent random vectors is demonstrated in terms of rearrangements. For the special case of Boltzmann-Shannon entropy, this lower bound is better than that given by the…

Information Theory · Computer Science 2015-05-07 Liyao Wang , Mokshay Madiman

This paper is twofold. In the first part, we present a refinement of the R\'enyi Entropy Power Inequality (EPI) recently obtained in \cite{BM16}. The proof largely follows the approach in \cite{DCT91} of employing Young's convolution…

Probability · Mathematics 2018-05-01 Jiange Li

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

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

We develop a reverse entropy power inequality for convex measures, which may be seen as an affine-geometric inverse of the entropy power inequality of Shannon and Stam. The specialization of this inequality to log-concave measures may be…

Functional Analysis · Mathematics 2012-04-02 Sergey Bobkov , Mokshay Madiman

The entropy power inequality, which plays a fundamental role in information theory and probability, may be seen as an analogue of the Brunn-Minkowski inequality. Motivated by this connection to Convex Geometry, we survey various recent…

Information Theory · Computer Science 2020-02-07 Mokshay Madiman , James Melbourne , Peng Xu

We tighten the Entropy Power Inequality (EPI) when one of the random summands is Gaussian. Our strengthening is closely connected to the concept of strong data processing for Gaussian channels and generalizes the (vector extension of)…

Information Theory · Computer Science 2016-02-10 Thomas A. Courtade

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

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

A condition, at which the one-dimensional inverse power potential becomes reflectionless during propagation through it of a plane wave, is obtained on the basis of SUSY QM methods. A scattering of a particle on spherically symmetric inverse…

Quantum Physics · Physics 2007-05-23 Sergei P. Maydanyuk

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

This paper concerns the reconstruction of a diffusion coefficient in an elliptic equation from knowledge of several power densities. The power density is the product of the diffusion coefficient with the square of the modulus of the…

Analysis of PDEs · Mathematics 2012-03-07 Guillaume Bal , Eric Bonnetier , Francois Monard , Faouzi Triki

The question of how irreversibility can emerge as a generic phenomena when the underlying mechanical theory is reversible has been a long-standing fundamental problem for both classical and quantum mechanics. We describe a mechanism for the…

Quantum Physics · Physics 2013-09-20 Cozmin Ududec , Nathan Wiebe , Joseph Emerson

New families of Fisher information and entropy power inequalities for sums of independent random variables are presented. These inequalities relate the information in the sum of $n$ independent random variables to the information contained…

Information Theory · Computer Science 2024-05-07 Mokshay Madiman , Andrew Barron

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

The reversibility and recurrence paradoxes are key issues that have been left unsolved in researches on the foundation of thermodynamics since the 19th century. This article shows that (1) the reversibility paradox can be overcome if we pay…

Statistical Mechanics · Physics 2021-07-27 Yoshihiro Nakato

We present a simple proof of the entropy-power inequality using an optimal transportation argument which takes the form of a simple change of variables. The same argument yields a reverse inequality involving a conditional differential…

Information Theory · Computer Science 2017-03-07 Olivier Rioul

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

Lower bounds for the R\'enyi entropies of sums of independent random variables taking values in cyclic groups of prime order under permutations are established. The main ingredients of our approach are extended rearrangement inequalities in…

Combinatorics · Mathematics 2021-10-20 Mokshay Madiman , Liyao Wang , Jae Oh Woo

Conditional on the extended Riemann hypothesis, we show that with high probability, the characteristic polynomial of a random symmetric $\{\pm 1\}$-matrix is irreducible. This addresses a question raised by Eberhard in recent work. The main…

Probability · Mathematics 2021-06-09 Asaf Ferber , Vishesh Jain , Ashwin Sah , Mehtaab Sawhney
‹ Prev 1 2 3 10 Next ›