38 citations · 176 across the 26 of their papers we have counts for
3 papers · 1 filter
Broadcasting on Random Directed Acyclic Graphs
Anuran Makur, Elchanan Mossel, Yury Polyanskiy
We study a generalization of the well-known model of broadcasting on trees. Consider a directed acyclic graph (DAG) with a unique source vertex , and suppose all other vertices…
Probabilistic Clustering Using Maximal Matrix Norm Couplings
David Qiu, Anuran Makur, Lizhong Zheng
In this paper, we present a local information theoretic approach to explicitly learn probabilistic clustering of a discrete random variable. Our formulation yields a convex maximiz…
Broadcasting on Bounded Degree DAGs
Anuran Makur, Elchanan Mossel, Yury Polyanskiy
We study the following generalization of the well-known model of broadcasting on trees. Consider an infinite directed acyclic graph (DAG) with a unique source node . Let the col…