Connections between classical and parametric network entropies.
Where this comes from
- Record sourced from PubMed, PMID 21246046.
- Also identified by DOI 10.1371/journal.pone.0015733 and PMC identifier 3016402.
- Licence recorded as CC BY.
- The licence permits redistribution, so the abstract is shown in full and the full text is available from the publisher.
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.
Medical subject headings
- Computer Graphics
- Entropy
- Numerical Analysis, Computer-Assisted