Over the past few years, a family of interesting new inequalities for the entropies of sums and differences of random variables has been developed by Ruzsa, Tao, and others, motivated by analogous results in additive combinatorics. This paper extends these earlier results to the case of random variables taking values in Rn or, more generally, in arbitrary locally compact and Polish abelian groups. We isolate and study a key quantity, the Ruzsa divergence between two probability distributions, and we show that its properties can be used to extend the earlier inequalities to the present general setting. The new results established include several variations on the theme that the entropies of the sum and the difference of two independent random variables severely constrain each other. Although the setting is quite general, the results are already of interest (and new) for random vectors in Rn. In that special case, we discuss quantitative bounds for the stability of the equality conditions in the entropy power inequality, a reverse entropy power inequality for log-concave random vectors, an information-theoretic analog of the Rogers-Shephard inequality for convex bodies, and consequences of some of our results to determinant inequalities for sums of positive-definite matrices. Moreover, by considering various multiplicative subgroups of the complex plane, one obtains new inequalities for the differential entropies of products and ratios of nonzero, complex-valued random variables.
We initiate the study of the Stam region, defined as the subset of the positive orthant in ℝ2n–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.
International audienceLet us define, for a compact set A ⊂ R n , the Minkowski averages of A: A(k) = a 1 + · · · + a k k : a 1 ,. .. , a k ∈ A = 1 k A + · · · + A k times. We study the monotonicity of the convergence of A(k) towards the convex hull of A, when considering the Hausdorff distance, the volume deficit and a non-convexity index of Schneider as measures of convergence. For the volume deficit, we show that monotonicity fails in general, thus disproving a conjecture of Bobkov, Madiman and Wang. For Schneider's non-convexity index, we prove that a strong form of monotonicity holds, and for the Hausdorff distance, we establish that the sequence is eventually nonincreasing
20 October 2020 in IEEE Transactions on Information Theory
We show that the uniform distribution minimizes entropy among all one-dimensional symmetric log-concave distributions with fixed variance, as well as various generalizations of this fact to Rényi entropies of orders less than 1 and with moment constraints involving $p$ -th absolute moments with $p\leq 2$ . As consequences, we give new capacity bounds for additive noise channels with symmetric log-concave noises, as well as for timing channels involving positive signal and noise where the noise has a decreasing log-concave density. In particular, we show that the capacity of an additive noise channel with symmetric, log-concave noise under an average power constraint is at most 0.254 bits per channel use greater than the capacity of an additive Gaussian noise channel with the same noise power. Consequences for reverse entropy power inequalities and connections to the slicing problem in convex geometry are also discussed.