On the Shannon entropy of the number of vertices with zero in-degree in randomly oriented hypergraphs

DOI10.4418/2019.74.1.8zbMath1427.94064arXiv1808.04166MaRDI QIDQ5205521

Christos Pelekis

Publication date: 12 December 2019

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

zbMATH Keywords

coloringShannon entropy

Mathematics Subject Classification ID

Hypergraphs (05C65) Combinatorial probability (60C05) Measures of information, entropy (94A17)

Cites Work

• Unnamed Item
• Circular representation problem on hypergraphs
• Matrix characterizations of circular-arc graphs
• Bernoulli trials of fixed parity, random and randomly oriented graphs
• Network Coloring and Colored Coin Games
• A tight upper bound on discrete entropy
• Sharp Bounds on the Entropy of the Poisson Law and Related Quantities
• Elements of Information Theory

This page was built for publication: On the Shannon entropy of the number of vertices with zero in-degree in randomly oriented hypergraphs