37 citations · 100 across the 18 of their papers we have counts for
Showing 2018 · cs.ITShow all
2 papers · 2 filters
cs.IT2018
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…
cs.IT2018
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…