Title :
Modularity properties of graph entropy
Author :
Korner, Jdnos ; Simonyi, Gdbor
Author_Institution :
Dept. of Comput. Sci., Rome Univ., Italy
fDate :
29 Jun-4 Jul 1997
Abstract :
Graph entropy is an information theoretic functional on a graph and a probability distribution on its vertex set. It is sub-additive with respect to graph union but not submodular in general. Here we give necessary and sufficient conditions on graphs for sub- and also for supermodularity of graph entropy with respect to every probability distribution
Keywords :
entropy; graph theory; probability; graph entropy; graph union; information theoretic functional; modularity properties; probability distribution; submodularity; supermodularity; vertex set; Computer science; Entropy; Probability distribution; Remuneration; Sufficient conditions;
Conference_Titel :
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location :
Ulm
Print_ISBN :
0-7803-3956-8
DOI :
10.1109/ISIT.1997.612928
