Broadcasting on Random Directed Acyclic Graphs
IEEE Transactions on Information Theory, pp. 780-812, 2020.
We study the following generalization of the wellknown model of broadcasting on trees. Consider an infinite directed acyclic graph (DAG) with a unique source vertex X. Let the collection of vertices at distance k from X be called the kth layer, and suppose every non-source vertex has indegree d ≥ 2. At layer 0, the source vertex is given ...More
PPT (Upload PPT)