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 language | English |
---|---|
Article number | e15733 |
Journal | PLoS ONE |
Volume | 6 |
Issue number | 1 |
DOIs | |
Publication status | Published - 2011 |
ASJC Scopus subject areas
- General Agricultural and Biological Sciences
- General Biochemistry,Genetics and Molecular Biology
- General Medicine