9 citations · 11 across the 10 of their papers we have counts for
4 papers · 1 filter
On Han- and Shearer-Type Information Inequalities: Equality Conditions and Combinatorial Applications
Gunank Jakhar, Gowtham R. Kurri, Suryajith Chillara +1
Madiman and Tetali established strong and weak fractional inequalities that subsume classical entropy subset inequalities such as Han's inequality and Shearer's lemma. In this work…
Shortest Paths with Linear Edge Weights
Suryajith Chillara, Kshitij Gajjar, Nithish Raja
We study shortest paths in directed graphs whose edge weights are of the form Here…
Conditioning Strengthens Classical Entropy and Matrix Inequalities: A Submodular Approach
Gunank Jakhar, Gowtham R. Kurri, Suryajith Chillara +1
Dembo, Cover, and Thomas (1991) developed an elegant information-theoretic framework for proving determinantal inequalities for positive definite matrices, which relies on the stru…
Generalized Information Inequalities via Submodularity, and Two Combinatorial Problems
Gunank Jakhar, Gowtham R. Kurri, Suryajith Chillara +1
It is well known that there is a strong connection between entropy inequalities and submodularity, since the entropy of a collection of random variables is a submodular function. U…