Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks

DOI10.1016/J.PHYSA.2014.02.060MaRDI QIDQ1782785zbMATH OpenOpenAlexFDO

Authors Hector Zenil, Fernando Soler-Toscano, Kamaludin Dingle, Ard A. Louis

Publication date 20 September 2018

Published in Physica A (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1306.0322

zbMATH Keywords

algorithmic probabilitycomplex networkscompressibilitygraph automorphismsKolmogorov complexitynetwork biology

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Deterministic network models in operations research (90B10)

Abstract: We show that numerical approximations of Kolmogorov complexity (K) applied to graph adjacency matrices capture some group-theoretic and topological properties of graphs and empirical networks ranging from metabolic to social networks. That K and the size of the group of automorphisms of a graph are correlated opens up interesting connections to problems in computational geometry, and thus connects several measures and concepts from complexity science. We show that approximations of K characterise synthetic and natural networks by their generating mechanisms, assigning lower algorithmic randomness to complex network models (Watts-Strogatz and Barabasi-Albert networks) and high Kolmogorov complexity to (random) Erdos-Renyi graphs. We derive these results via two different Kolmogorov complexity approximation methods applied to the adjacency matrices of the graphs and networks. The methods used are the traditional lossless compression approach to Kolmogorov complexity, and a normalised version of a Block Decomposition Method (BDM) measure, based on algorithmic probability theory.

Recommendations

• On measuring the complexity of networks: Kolmogorov complexity versus entropy
• Methods and applications of algorithmic complexity. Beyond statistical lossless compression
• Kolmogorov Random Graphs and the Incompressibility Method
• scientific article; zbMATH DE number 1071771
• Comparison between the complexity of a function and the complexity of its graph

Cites work

• A formal theory of inductive inference. Part II
• A history of graph entropy measures
• An introduction to Kolmogorov complexity and its applications
• Asymptotic behavior and ratios of complexity in cellular automata
• Collective dynamics of `small-world' networks
• Community structure in social and biological networks
• Complexity in chemistry, biology and ecology.
• Complexity of networks
• Conflict Anticipation in the Search for Graph Automorphisms
• Correspondence and independence of numerical evaluations of algorithmic information measures
• Efficient Planarity Testing
• Entropy and the complexity of graphs revisited
• scientific article; zbMATH DE number 1911266 (Why is no real title available?)
• scientific article; zbMATH DE number 842715 (Why is no real title available?)
• Kolmogorov Random Graphs and the Incompressibility Method
• Networks. An introduction.
• Numerical evaluation of algorithmic complexity for short strings: a glance into the innermost structure of randomness
• On non-computable functions
• On the Kolmogorov-Chaitin Complexity for short sequences
• On the Length of Programs for Computing Finite Binary Sequences
• Statistical mechanics of complex networks
• The Determination of the Value of Rado's Noncomputable Function | sum(k) for Four-State Turing Machines
• The graph isomorphism disease

Cited in

(3)

• On measuring the complexity of networks: Kolmogorov complexity versus entropy
• A computable measure of algorithmic probability by finite approximations with an application to integer sequences
• Simplicity bias, algorithmic probability, and the random logistic map

Describes a project that uses

Uses Software

• DIMACS
• OACC
• acss

This page was built for publication: Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1782785)