Entropy 2012, 14(3), 559-570; doi:10.3390/e14030559

Entropy and the Complexity of Graphs Revisited

1 Department of Computer Science, The City College of New York (CUNY), 138th Street at ConventAvenue, New York, NY 10031, USA 2 Institute for Bioinformatics and Translational Research, UMIT, Eduard Wallnoefer Zentrum 1, 6060, Hall in Tyrol, Austria
* Authors to whom correspondence should be addressed.
Received: 16 January 2012; in revised form: 5 March 2012 / Accepted: 12 March 2012 / Published: 14 March 2012
PDF Full-text Download PDF Full-Text [133 KB, uploaded 14 March 2012 14:09 CET]
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.
Keywords: complex networks; Shannon entropy; graph entropy

Article Statistics

Load and display the download statistics.

Citations to this Article

Cite This Article

MDPI and ACS Style

Mowshowitz, A.; Dehmer, M. Entropy and the Complexity of Graphs Revisited. Entropy 2012, 14, 559-570.

AMA Style

Mowshowitz A, Dehmer M. Entropy and the Complexity of Graphs Revisited. Entropy. 2012; 14(3):559-570.

Chicago/Turabian Style

Mowshowitz, Abbe; Dehmer, Matthias. 2012. "Entropy and the Complexity of Graphs Revisited." Entropy 14, no. 3: 559-570.

Entropy EISSN 1099-4300 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert