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 entropy, lossles...

Descripción completa

Detalles Bibliográficos
Autores principales: Zenil, Hector, Kiani, Narsis A., Tegnér, Jesper
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2018
Materias:
Review
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7513075/
https://www.ncbi.nlm.nih.gov/pubmed/33265640
http://dx.doi.org/10.3390/e20080551

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7513075/
https://www.ncbi.nlm.nih.gov/pubmed/33265640
http://dx.doi.org/10.3390/e20080551

Ejemplares similares