Combinatorial Entropy Power Inequalities: A Preliminary Study of the Stam region

Abstract

We initiate the study of the Stam region, defined as the subset of the positive orthant in ${\mathbb{R}}^{2^n-1}$ that arises from considering entropy powers of subset sums of $n$ independent random vectors in a Euclidean space of finite dimension. We show that the class of fractionally superadditive set functions provides an outer bound to the Stam region, resolving a conjecture of A. R. Barron and the first author. On the other hand, the entropy power of a sum of independent random vectors is not supermodular in any dimension. We also develop some qualitative properties of the Stam region, showing for instance that its closure is a logarithmically convex cone.

16 pages

References in corpus (7)

• Dimensional behaviour of entropy and information
• Cores of Cooperative Games in Information Theory
• Rogozin's convolution inequality for locally compact groups
• Entropy Inequalities for Sums in Prime Cyclic Groups
• Majorization and Rényi Entropy Inequalities via Sperner Theory
• Thinning, photonic beamsplitting, and a general discrete entropy power inequality
• The convexification effect of Minkowski summation

Cited by in corpus (11)

• Entropy Inequalities for Sums in Prime Cyclic Groups
• Majorization and Rényi Entropy Inequalities via Sperner Theory
• The Differential Entropy of Mixtures: New Bounds and Applications
• Sharp moment-entropy inequalities and capacity bounds for log-concave distributions
• Two remarks on generalized entropy power inequalities
• On the volume of the Minkowski sum of zonoids
• Volumes of subset Minkowski sums and the Lyusternik region
• Conditional Rényi entropy and the relationships between Rényi capacities
• An entropy inequality for symmetric random variables
• Sumset estimates in convex geometry
• The norm of the Fourier transform on compact or discrete abelian groups