Connections between Classical and Parametric Network Entropies

M. Dehmer, A. Mowshowitz, Frank Emmert-Streib

Research output: Contribution to journalArticlepeer-review

20 Citations (Scopus)

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.
Original languageEnglish
Article numbere15733
JournalPLoS ONE
Volume6
Issue number1
DOIs
Publication statusPublished - 2011

ASJC Scopus subject areas

  • Agricultural and Biological Sciences(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Medicine(all)

Fingerprint

Dive into the research topics of 'Connections between Classical and Parametric Network Entropies'. Together they form a unique fingerprint.

Cite this