Publications and Research
Document Type
Article
Publication Date
3-14-2012
Abstract
This paper presents a taxonomy and overview of approaches to the measurement of graph and network complexity. The taxonomy distinguishes between deterministic (e.g., Kolmogorov complexity) and probabilistic approaches with a view to placing entropy-based probabilistic measurement in context. Entropy-based measurement is the main focus of the paper. Relationships between the different entropy functions used to measure complexity are examined; and intrinsic (e.g., classical measures) and extrinsic (e.g., Körner entropy) variants of entropy-based models are discussed in some detail.
Recommended Citation
Mowshowitz, Abbe and Dehmer, Matthias, "Entropy and the Complexity of Graphs Revisited" (2012). CUNY Academic Works.
https://academicworks.cuny.edu/cc_pubs/560
Comments
This article originally appeared in Entropy, available at DOI:10.3390/e14030559
This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution license (http://creativecommons.org/licenses/by/4.0/).