Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
A Review of Graph and Network Complexity from an Algorithmic Information Perspective
by
Zenil, Hector
, Tegnér, Jesper
, Kiani, Narsis A.
in
algorithmic information theory
/ algorithmic probability
/ algorithmic randomness
/ biological networks
/ complex networks
/ Kolmogorov-Chaitin complexity
/ Review
2018
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
A Review of Graph and Network Complexity from an Algorithmic Information Perspective
by
Zenil, Hector
, Tegnér, Jesper
, Kiani, Narsis A.
in
algorithmic information theory
/ algorithmic probability
/ algorithmic randomness
/ biological networks
/ complex networks
/ Kolmogorov-Chaitin complexity
/ Review
2018
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
A Review of Graph and Network Complexity from an Algorithmic Information Perspective
by
Zenil, Hector
, Tegnér, Jesper
, Kiani, Narsis A.
in
algorithmic information theory
/ algorithmic probability
/ algorithmic randomness
/ biological networks
/ complex networks
/ Kolmogorov-Chaitin complexity
/ Review
2018
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
A Review of Graph and Network Complexity from an Algorithmic Information Perspective
Journal Article
A Review of Graph and Network Complexity from an Algorithmic Information Perspective
2018
Request Book From Autostore
and Choose the Collection Method
Overview
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, lossless compressibility and algorithmic complexity when used to identify aspects and properties of complex networks. We review the fragility of computable measures on the one hand and the invariant properties of algorithmic measures on the other demonstrating how current approaches to algorithmic complexity are misguided and suffer of similar limitations than traditional statistical approaches such as Shannon entropy. Finally, we review some current definitions of algorithmic complexity which are used in analyzing labelled and unlabelled graphs. This analysis opens up several new opportunities to advance beyond traditional measures.
Publisher
MDPI,MDPI AG
This website uses cookies to ensure you get the best experience on our website.