Correlation of Automorphism Group Size and Topological Properties with Program-size Complexity Evaluations of Graphs and Complex Networks

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.

15 2-column pages, 20 figures. Forthcoming in Physica A: Statistical Mechanics and its Applications

References in corpus (6)

• Emergence of Symmetry in Complex Networks
• Network Quotients: Structural Skeletons of Complex Systems
• Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures
• Subgraph Ensembles and Motif Discovery Using a New Heuristic for Graph Isomorphism
• Two-Dimensional Kolmogorov Complexity and Validation of the Coding Theorem Method by Compressibility
• Graph animals, subgraph sampling and motif search in large networks

Cited by in corpus (15)

• Low Algorithmic Complexity Entropy-deceiving Graphs
• A Review of Methods for Estimating Algorithmic Complexity: Options, Challenges, and New Directions
• Machine Learning Characterization of Cancer Patients-Derived Extracellular Vesicles using Vibrational Spectroscopies
• Approximations of Algorithmic and Structural Complexity Validate Cognitive-behavioural Experimental Results
• The Thermodynamics of Network Coding, and an Algorithmic Refinement of the Principle of Maximum Entropy
• Multiclass classification utilising an estimated algorithmic probability prior
• Quantifying Natural and Artificial Intelligence in Robots and Natural Systems with an Algorithmic Behavioural Test
• Symmetry and Algorithmic Complexity of Polyominoes and Polyhedral Graphs
• On complexity of post-processing in analyzing GATE-driven X-ray spectrum
• Algorithmic Information Dynamics of Persistent Patterns and Colliding Particles in the Game of Life
• Algorithmically probable mutations reproduce aspects of evolution such as convergence rate, genetic memory, and modularity
• On the Complexity and Behaviour of Cryptocurrencies Compared to Other Markets
• Paths to Unconventional Computing: Causality in Complexity
• Which is the least complex explanation? Abduction and complexity
• Investigating Estimated Kolmogorov Complexity as a Means of Regularization for Link Prediction