Connections between classical and parametric network entropies

Matthias Dehmer; Abbe Mowshowitz; Frank Emmert-Streib

doi:10.1371/journal.pone.0015733

Connections between classical and parametric network entropies

PLoS One. 2011 Jan 5;6(1):e15733. doi: 10.1371/journal.pone.0015733.

Authors

Matthias Dehmer¹, Abbe Mowshowitz, Frank Emmert-Streib

Affiliation

¹ Institute for Bioinformatics and Translational Research, UMIT, Hall in Tirol, Austria. matthias.dehmer@umit.at

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.

Publication types

Research Support, Non-U.S. Gov't
Research Support, U.S. Gov't, Non-P.H.S.

MeSH terms

Algorithms
Computer Graphics*
Entropy*
Numerical Analysis, Computer-Assisted*
Probability