21 citations · 112 across the 37 of their papers we have counts for
Showing 2020 · cs.ITShow all
3 papers · 2 filters
cs.IT2020
Strong data processing constant is achieved by binary inputs
Or Ordentlich, Yury Polyanskiy
For any channel the strong data processing constant is defined as the smallest number such that holds for any Markov chain $U-X…
cs.IT2020★ 1 cited
Broadcasting on trees near criticality
Yuzhou Gu, Hajir Roozbehani, Yury Polyanskiy
We revisit the problem of broadcasting on -ary trees: starting from a Bernoulli random variable at a root vertex, each vertex forwards its value across binary symme…
cs.IT2020
Non-linear Log-Sobolev inequalities for the Potts semigroup and applications to reconstruction problems
Yuzhou Gu, Yury Polyanskiy
Consider the semigroup of random walk on a complete graph, which we call the Potts semigroup. Diaconis and Saloff-Coste computed the maximum of the ratio of the relative entropy an…