The entropy power of a sum is fractionally superadditive

Authors:
Mokshay Madiman;Farhad Ghassemi
Affiliations:
Department of Statistics, Yale University, New Haven, CT;Sauder School of Business, University of British Columbia, Vancouver, BC, Canada
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Year:
2009

Citing 6
Cited 0

Some intersection theorems for ordered sets and graphs

Journal of Combinatorial Theory Series A
Cores of cooperative games in information theory

EURASIP Journal on Wireless Communications and Networking - Theory and Applications in Multiuser/Multiterminal Communications
The rate-distortion function for the quadratic Gaussian CEO problem

IEEE Transactions on Information Theory
On characterization of entropy function via information inequalities

IEEE Transactions on Information Theory
Monotonic Decrease of the Non-Gaussianness of the Sum of Independent Random Variables: A Simple Proof

IEEE Transactions on Information Theory
Generalized Entropy Power Inequalities and Monotonicity Properties of Information

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is shown that the entropy power of a sum of independent random vectors, seen as a set function, is fractionally superadditive. This resolves a conjecture of the first author and A. R. Barron, and implies in particular all previously known entropy power inequalities for independent random variables. It is also shown that, for general dimension, the entropy power of a sum of independent random vectors is not supermodular.