Journal
ENTROPY
Volume 14, Issue 3, Pages 559-570Publisher
MDPI
DOI: 10.3390/e14030559
Keywords
complex networks; Shannon entropy; graph entropy
Categories
Funding
- U.S. Army Research Laboratory
- U.K. Ministry of Defense [W911NF-06-3-0001]
- Austrian Science Funds
- Standortagentur Tirol [P22029-N13]
- Austrian Science Fund (FWF) [P 22029] Funding Source: researchfish
Ask authors/readers for more resources
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., Korner entropy) variants of entropy-based models are discussed in some detail.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available