On sequential structures in incompressible multidimensional networks
From MaRDI portal
Publication:6656782
DOI10.1142/s0129626424500117MaRDI QIDQ6656782
Klaus Wehmuth, Hector Zenil, Artur Ziviani, Felipe S. Abrahão
Publication date: 3 January 2025
Published in: Parallel Processing Letters (Search for Journal in Brave)
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A polynomial-time algorithm for computing absolutely normal numbers
- Entropy and the complexity of graphs revisited
- On multiaspect graphs
- Multiaspect graphs: algebraic representation and algorithms
- On measuring the complexity of networks: Kolmogorov complexity versus entropy
- How many cooks spoil the soup?
- Numerical evaluation of algorithmic complexity for short strings: a glance into the innermost structure of randomness
- Algorithmic networks: central time to trigger expected emergent open-endedness
- Scale-Free Networks: A Decade and Beyond
- Algorithmic Randomness and Complexity
- An Introduction to Temporal Graphs: An Algorithmic Perspective
- Information: The Algorithmic Paradigm
- Some equivalences between Shannon entropy and Kolmogorov complexity
- Complexity distortion theory
- Kolmogorov Random Graphs and the Incompressibility Method
- A classification for community discovery methods in complex networks
- Emergent Open-Endedness from Contagion of the Fittest
- Structure of triadic relations in multiplex networks
- Effective aspects of algorithmically random structures
- Compression of Data Streams Down to Their Information Content
- A computable absolutely normal Liouville number
- Algorithmic Information Dynamics
- An introduction to Kolmogorov complexity and its applications
- An example of a computable absolutely normal number
- Challenges in community discovery on temporal networks
- Time centrality in dynamic complex networks
This page was built for publication: On sequential structures in incompressible multidimensional networks
