Artículo
Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks
Autor/es | Zenil, Hector
Soler Toscano, Fernando Dingle, Kamaludin Louis, Ard A. |
Departamento | Universidad de Sevilla. Departamento de Filosofía y Lógica y Filosofía de la Ciencia |
Fecha de publicación | 2014 |
Fecha de depósito | 2017-09-04 |
Publicado en |
|
Resumen | We show that numerical approximations of Kolmogorov complexity (K) of graphs and networks capture some group-theoretic and topological properties of empirical networks, ranging from metabolic to social networks, and of ... We show that numerical approximations of Kolmogorov complexity (K) of graphs and networks capture some group-theoretic and topological properties of empirical networks, ranging from metabolic to social networks, and of small synthetic networks that we have produced. 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 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) based on algorithmic probability theory. |
Agencias financiadoras | Ministerio de Economía y Competitividad (MINECO). España |
Identificador del proyecto | info:eu-repo/grantAgreement/MINECO/FFI2011-15945-E |
Cita | Zenil, H., Soler Toscano, F., Dingle, K. y Louis, A.A. (2014). Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks. Physica A: Statistical Mechanics and its Applications, 404, 341-358. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
correlation_automorphism_prepr ... | 1.269Mb | [PDF] | Ver/ | |