On sequential structures in incompressible multidimensional networks

DOI10.1142/S0129626424500117MaRDI QIDQ6656782zbMATH OpenFDO

Authors Felipe S. Abrahão, Klaus Wehmuth, Hector Zenil, Artur Ziviani

Publication date 3 January 2025

Published in Parallel Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129626424500117

zbMATH Keywords

algorithmic informationcomplex networkslossless compressionmultidimensional systemsnetwork topology

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Complex network dimension and path counts
• Complexity of networks
• A novel topology identification method based on compressive sensing for multidimensional networks
• Information theory of networks

Cites work

• A classification for community discovery methods in complex networks
• A computable absolutely normal Liouville number
• A polynomial-time algorithm for computing absolutely normal numbers
• Algorithmic Information Dynamics
• Algorithmic networks: central time to trigger expected emergent open-endedness
• Algorithmic randomness and complexity.
• An example of a computable absolutely normal number
• An introduction to Kolmogorov complexity and its applications
• An introduction to temporal graphs: an algorithmic perspective
• Challenges in community discovery on temporal networks
• Complexity distortion theory
• Compression of Data Streams Down to Their Information Content
• Effective aspects of algorithmically random structures
• Emergent Open-Endedness from Contagion of the Fittest
• Entropy and the complexity of graphs revisited
• How many cooks spoil the soup?
• scientific article; zbMATH DE number 107482 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• scientific article; zbMATH DE number 1911266 (Why is no real title available?)
• scientific article; zbMATH DE number 5252406 (Why is no real title available?)
• Information: The Algorithmic Paradigm
• Kolmogorov Random Graphs and the Incompressibility Method
• Multiaspect graphs: algebraic representation and algorithms
• Numerical evaluation of algorithmic complexity for short strings: a glance into the innermost structure of randomness
• On measuring the complexity of networks: Kolmogorov complexity versus entropy
• On multiaspect graphs
• Scale-free networks: a decade and beyond
• Some equivalences between Shannon entropy and Kolmogorov complexity
• Structure of triadic relations in multiplex networks
• Time centrality in dynamic complex networks

This page was built for publication: On sequential structures in incompressible multidimensional networks

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