On sequential structures in incompressible multidimensional networks

DOI10.1142/S0129626424500117MaRDI QIDQ6656782FDOQ6656782

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)

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

zbMATH Keywords

algorithmic informationcomplex networksnetwork topologymultidimensional systemslossless compression

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) 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)

Cites Work

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

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