Connections between Classical and Parametric Network Entropies

Authors

Matthias Dehmer, Institute for Bioinformatics and Translational Research
Abbe Mowshowitz, CUNY City College
Frank Emmert-Streib, Queen's University Belfast

Document Type

Article

Publication Date

January 2011

Abstract

This paper explores relationships between classical and parametric measures of graph (or network) complexity. Classical measures are based on vertex decompositions induced by equivalence relations. Parametric measures, on the other hand, are constructed by using information functions to assign probabilities to the vertices. The inequalities established in this paper relating classical and parametric measures lay a foundation for systematic classification of entropy-based measures of graph complexity.

Comments

This work was originally published in PLoS ONE, available at doi:10.1371/journal.pone.0015733.