5 papers
A Proof of the Most Informative Boolean Function Conjecture
Zijie Chen, Amin Gohari, Adel Javanmard +4
Let be uniform on , let be obtained by passing its coordinates independently through a binary symmetric channel with crossover probability , and let $g:\{-1,…
The Capacity Region for Classes of Sum-Broadcast Channels
Amin Gohari, Yi Liu, Chandra Nair
We compute the capacity region of a sum of broadcast channels whose components are degraded, less-noisy, more-capable, deterministic, or semi-deterministic. We achieve this by show…
Ribbons from Independence Structure: Hypercontractivity, -Mutual Information, and Matrix -Entropy
Chenyu Wang, Amin Gohari
We study the hypercontractivity ribbon and the -ribbon for joint distributions that obey a given independence structure, obtaining tight bounds in some basic regimes. For genera…
On Dependence Measures Based on -Divergence and -Entropy
Chenyu Wang, Amin Gohari
We study dependence measures induced by -divergence (also known as -divergence in the literature) for finite random variables. We define conditional -mutual information t…
A Differential Equation Approach to the Most-Informative Boolean Function Conjecture
Zijie Chen, Amin Gohari, Chandra Nair
We study the most-informative Boolean function conjecture using a differential equation approach. This leads to a formulation of a functional inequality on finite-dimensional rando…