Entropy and the Complexity of Graphs Revisited
AbstractThis 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. View Full-Text
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Mowshowitz, A.; Dehmer, M. Entropy and the Complexity of Graphs Revisited. Entropy 2012, 14, 559-570.
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.