Entropy splitting hypergraphs

Abstract

Hypergraph entropy is a sub-additive functional on hypergraphs. We characterize those uniform hypergraphs F for which the entropy of F and the entropy of its complement adds up exactly to the entropy of the complete uniform hypergraph. Hypergraph entropy is an information theoretic functional on a hypergraph with a probability distribution on its vertex set. It is a generalisation of graph entropy.<>