Broadcasting on Random Directed Acyclic Graphs

DOI10.1109/TIT.2019.2935772zbMath1434.94003arXiv1811.03946OpenAlexW2900073520MaRDI QIDQ5211634

Elchanan Mossel, Yury Polyanskiy, Anuran Makur

Publication date: 28 January 2020

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.03946

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Communication theory (94A05)

Related Items (5)

Galton--Watson Processes and Their Role as Building Blocks for Branching Processes ⋮ Combinatorial statistics and the sciences ⋮ How heavy independent sets help to find arborescences with many leaves in DAGs ⋮ Sufficient condition for root reconstruction by parsimony on binary trees with general weights ⋮ Broadcasting on random recursive trees

This page was built for publication: Broadcasting on Random Directed Acyclic Graphs