On the entropy of sums

91 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Causal Discovery from Heterogeneous/Nonstationary Data (2019, background): “2, the assumptions in Section 3.1, and the properties of mutual information given in (Madiman, 2008).”
Causal Discovery from Nonstationary/Heterogeneous Data: Skeleton Estimation and Orientation Determination (2017, background): “1, the assumptions in Section 3.1, and the properties of mutual information given in [Madiman, 2008].”
On a conjecture of Marton (2023, methodology): “The ﬁrst is an inequality of Madiman [22, Theorem I], which is a more general form of an inequality of Kaimanovich and Vershik [13, Proposition 1.3].”
Reverse Brunn–Minkowski and reverse entropy power inequalities for convex measures (2011, methodology): “Section 7 introduces into convex geometry a submodularity result for the entropy of sums, first developed in [32], and discusses some corollaries, including the connection of”
Discovery and Visualization of Nonstationary Causal Models (2015, background): “Then they are not adjacent in G aug , which recall is the graph that incorporates Because all g l ( c ) and θ m ( C ) are deterministic functions of C , we have According to [18] , Eqs.”
On self-similar sets with overlaps and inverse theorems for entropy (2012, background): “It was more recently rediscovered by Madiman and his co-authors [21], [22] and, in a weaker form, by Tao [35], who later made the connection to additive combinatorics.”