Determinant inequalities via information theory

By Thomas M. Cover, Joy A. Thomas. 1988

How researchers see this paper

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

PacGAN: The Power of Two Samples in Generative Adversarial Networks (2017, background): “, [26], [27], [28], [29], [30], [31], [32], [33], [34]) where operational interpretations of mutual information and corresponding data processing inequalities have given rise to simple proofs of strong technical results.”
Graph Learning From Data Under Laplacian and Structural Constraints (2016, methodology): “By using Hadamard’s inequality det(Θ) ≤ ni=1(Θ)ii [61] and taking the log of both sides, the following bound is obtained”
Information theoretic inequalities (1991, background): “>h@) n * The conditional entropy rate per element for a k eleProof: (Following [16]).”