A Review of Graph and Network Complexity from an Algorithmic Information Perspective

A Review of Graph and Network Complexity from an Algorithmic Information Perspective

Information-theoretic-based measures have been useful in quantifying network complexity. Here we briefly survey and contrast (algorithmic) information-theoretic methods which have been used to characterize graphs and networks. We illustrate the strengths and limitations of Shannon’s entrop...

Full description

Bibliographic Details
Main Authors: Hector Zenil, Narsis A. Kiani, Jesper Tegnér
Format: Article
Language:English
Published: MDPI AG 2018-07-01
Series:Entropy
Subjects:
algorithmic information theory
complex networks
Kolmogorov-Chaitin complexity
algorithmic randomness
algorithmic probability
biological networks
Online Access:http://www.mdpi.com/1099-4300/20/8/551

Internet

http://www.mdpi.com/1099-4300/20/8/551

Similar Items