Broadcasting on Random Directed Acyclic Graphs

IEEE Transactions on Information Theory, pp. 780-812, 2020.

Cited by: 4|Bibtex|Views18|DOI:https://doi.org/10.1109/TIT.2019.2935772
EI WOS
Other Links: dblp.uni-trier.de|academic.microsoft.com|arxiv.org

Abstract:

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

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments