English
Related papers

Related papers: An information-theoretic proof of Nash's inequalit…

200 papers

We show that Shannon's entropy--power inequality admits a strengthened version in the case in which the densities are log-concave. In such a case, in fact, one can extend the Blachman--Stam argument to obtain a sharp inequality for the…

Information Theory · Computer Science 2014-08-19 Giuseppe Toscani

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 well known duality between the Sobolev inequality and the Hardy-Littlewood-Sobolev inequality suggests that the Nash inequality could also have an interesting dual form, even though the Nash inequality relates three norms instead of…

Functional Analysis · Mathematics 2018-11-28 Eric A. Carlen , Elliott H. Lieb

In this paper, we prove the concavity of $p$-entropy power of probability densities solving the $p$-heat equation on closed Riemannian manifold with nonnegative Ricci curvature. As applications, we give new proofs of $L^p$-Euclidean Nash…

Analysis of PDEs · Mathematics 2019-02-05 Yu-Zhao Wang , Xinxin Zhang

Aim of this short note is to study Shannon's entropy power along entropic interpolations, thus generalizing Costa's concavity theorem. We shall provide two proofs of independent interest: the former by $\Gamma$-calculus, hence applicable to…

Information Theory · Computer Science 2020-12-23 Luca Tamanini

It is known that many classical inequalities linked to convolutions can be obtained by looking at the monotonicity in time of convolutions of powers of solutions to the heat equation, provided that both the exponents and the coefficients of…

Mathematical Physics · Physics 2013-09-26 Giuseppe Toscani

We study the $p$-R\'{e}nyi entropy power inequality with a weight factor $t$ on two independent continuous random variables $X$ and $Y$. The extension essentially relies on a modulation on the sharp Young's inequality due to Bobkov and…

Quantum Physics · Physics 2023-11-28 Junseo Lee , Hyeonjun Yeo , Kabgyun Jeong

The aim of this note is to connect a reversed form of the Gross logarithmic Sobolev inequality with the Gaussian maximum of Shannon's entropy power. There is thus a complete parallel with the well-known link between logarithmic Sobolev…

Probability · Mathematics 2013-10-23 Djalil Chafai

While most useful information theoretic inequalities can be deduced from the basic properties of entropy or mutual information, up to now Shannon's entropy power inequality (EPI) is an exception: Existing information theoretic proofs of the…

Information Theory · Computer Science 2016-11-17 Olivier Rioul

In the past over two decades, very fruitful results have been obtained in information theory in the study of the Shannon entropy. This study has led to the discovery of a new class of constraints on the Shannon entropy called…

Information Theory · Computer Science 2025-03-07 Raymond W. Yeung

Statements of Shannon's Noiseless Coding Theorem by various authors, including the original, are reviewed and clarified. Traditional statements of the theorem are often unclear as to when it applies. A new notation is introduced and the…

Information Theory · Computer Science 2010-11-01 L. F. Johnson

We study conditional linear information inequalities, i.e., linear inequalities for Shannon entropy that hold for distributions whose entropies meet some linear constraints. We prove that some conditional information inequalities cannot be…

Information Theory · Computer Science 2013-10-30 Tarik Kaced , Andrei Romashchenko

We show that a proper expression of the uncertainty relation for a pair of canonically-conjugate continuous variables relies on entropy power, a standard notion in Shannon information theory for real-valued signals. The resulting…

Quantum Physics · Physics 2018-01-16 Anaelle Hertz , Michael G. Jabbour , Nicolas J. Cerf

While most useful information theoretic inequalities can be deduced from the basic properties of entropy or mutual information, Shannon's entropy power inequality (EPI) seems to be an exception: available information theoretic proofs of the…

Information Theory · Computer Science 2016-11-17 Olivier Rioul

We provide a simple physical interpretation, in the context of the second law of thermodynamics, to the information inequality (a.k.a. the Gibbs' inequality, which is also equivalent to the log-sum inequality), asserting that the relative…

Information Theory · Computer Science 2009-03-29 Neri Merhav

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

There is a parallelism between Shannon information theory and algorithmic information theory. In particular, the same linear inequalities are true for Shannon entropies of tuples of random variables and Kolmogorov complexities of tuples of…

Information Theory · Computer Science 2022-09-12 Bruno Bauwens , Peter Gács , Andrei Romashchenko , Alexander Shen

We associate to the p-th R\'enyi entropy a definition of entropy power, which is the natural extension of Shannon's entropy power and exhibits a nice behaviour along solutions to the p-nonlinear heat equation in $R^n$. We show that the…

Information Theory · Computer Science 2014-09-16 Giuseppe Savarè , Giuseppe Toscani

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

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
‹ Prev 1 2 3 10 Next ›