DocumentCode :
2619137
Title :
Entropy splitting hypergraphs
Author :
Simonyi, Gábor
Author_Institution :
Math. Inst., Acad. of Sci., Budapest, Hungary
fYear :
1994
fDate :
27 Jun-1 Jul 1994
Firstpage :
313
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
Keywords :
entropy; functional analysis; graph theory; probability; entropy splitting hypergraphs; graph entropy; information theory; probability distribution; sub-additive functional; uniform hypergraphs; Application software; Computer science; Entropy; Mutual information; Probability distribution; Random variables;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location :
Trondheim
Print_ISBN :
0-7803-2015-8
Type :
conf
DOI :
10.1109/ISIT.1994.394705
Filename :
394705
Link To Document :
بازگشت