Connections between Classical and Parametric Network Entropies

Matthias Dehmer, Abbe Mowshowitz and Frank Emmert-Streib

PLOS ONE, 2011, vol. 6, issue 1, 1-8

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.

Date: 2011
References: View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0015733 (text/html)
https://journals.plos.org/plosone/article/file?id= ... 15733&type=printable (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:plo:pone00:0015733

DOI: 10.1371/journal.pone.0015733

Access Statistics for this article

More articles in PLOS ONE from Public Library of Science
Bibliographic data for series maintained by plosone ().