On Measuring the Complexity of Networks: Kolmogorov Complexity versus Entropy

, &
Complexity:1-12 (2017)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

DOI

10.1155/2017/3250301

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,571

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Information-Theoretic Measures Predict the Human Judgment of Rhythm Complexity.Remi Fleurian, Tim Blackwell, Oded Ben‐Tal & Daniel Müllensiefen - 2017 - Cognitive Science 41 (3):800-813.
Complexity as a Framework for Prediction, Optimization, and Assurance.S. F. Bush - 2004 - In Susan Shannon (ed.), Focus on Computer Science Research. New York: Nova Science.
Kolmogorov complexity for possibly infinite computations.Verónica Becher & Santiago Figueira - 2005 - Journal of Logic, Language and Information 14 (2):133-148.
Complexity of networks II: The set complexity of edge‐colored graphs.Tomasz M. Ignac, Nikita A. Sakhanenko & David J. Galas - 2012 - Complexity 17 (5):23-36.
Using Shannon entropy and Kolmogorov complexity to study the communicative system and cognitive capacities in ants.Boris Ryabko & Zhanna Reznikova - 1996 - Complexity 2 (2):37-42.
Kolmogorov Complexity and Noncomputability.George Davie - 2002 - Mathematical Logic Quarterly 48 (4):574-581.
Kolmogorov complexity estimates for detection of viruses in biologically inspired security systems: A comparison with traditional approaches.Sanjay Goel & Stephen F. Bush - 2003 - Complexity 9 (2):54-73.
Kolmogorov complexity and information theory. With an interpretation in terms of questions and answers.Peter D. Grünwald & Paul M. B. Vitányi - 2003 - Journal of Logic, Language and Information 12 (4):497-529.
Thermal roots of correlation‐based complexity.Philip Fraundorf - 2008 - Complexity 13 (3):18-26.
Kolmogorov Complexity and Noncomputability.George Davie - 2002 - Mathematical Logic Quarterly 48 (5):574-580.
Kolmogorov complexity and set theoretical representations of integers.Marie Ferbus-Zanda & Serge Grigorieff - 2006 - Mathematical Logic Quarterly 52 (4):375-403.
Complexity of complexity and strings with maximal plain and prefix Kolmogorov complexity.B. Bauwens & A. Shen - 2014 - Journal of Symbolic Logic 79 (2):620-632.
Computationally tractable pairwise complexity profile.Yaneer Bar‐Yam & Dion Harmon - 2013 - Complexity 18 (5):20-27.
Effective fractal dimensions.Jack H. Lutz - 2005 - Mathematical Logic Quarterly 51 (1):62-72.
Complexity of networks I: The set‐complexity of binary graphs.Nikita A. Sakhanenko & David J. Galas - 2011 - Complexity 17 (2):51-64.

Analytics

Added to PP
2017-11-02

Downloads
16 (#900,320)

6 months
3 (#967,057)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

No references found.

Add more references