85 citations · 178 across the 22 of their papers we have counts for
7 papers · 1 filter
Assembly Theory Reduced to Shannon Entropy and Rendered Redundant by Naive Statistical Algorithms
Luan Ozelim, Abicumaran Uthamacumaran, Felipe S. Abrahão +4
Assembly Theory (AT) and its central measure, the assembly index (Ai), represent an invaluable opportunity to address some of the most persistent and widespread conflations and mis…
Assembly Theory is an approximation to algorithmic complexity based on LZ compression that does not explain selection or evolution
Felipe S. Abrahão, Santiago Hernández-Orozco, Narsis A. Kiani +2
We prove the full equivalence between Assembly Theory (AT) and Shannon Entropy via a method based upon the principles of statistical compression renamed `assembly index' that belon…
On the Salient Limitations of the Methods of Assembly Theory and their Classification of Molecular Biosignatures
Abicumaran Uthamacumaran, Felipe S. Abrahão, Narsis A. Kiani +1
We demonstrate that the assembly pathway method underlying assembly theory (AT) is an encoding scheme widely used by popular statistical compression algorithms. We show that in all…
The Thermodynamics of Network Coding, and an Algorithmic Refinement of the Principle of Maximum Entropy
Hector Zenil, Narsis A. Kiani, Jesper Tegnér
The principle of maximum entropy (Maxent) is often used to obtain prior probability distributions as a method to obtain a Gibbs measure under some restriction giving the probabilit…
A Decomposition Method for Global Evaluation of Shannon Entropy and Local Estimations of Algorithmic Complexity
Hector Zenil, Santiago Hernández-Orozco, Narsis A. Kiani +2
We investigate the properties of a Block Decomposition Method (BDM), which extends the power of a Coding Theorem Method (CTM) that approximates local estimations of algorithmic com…
Low Algorithmic Complexity Entropy-deceiving Graphs
Hector Zenil, Narsis Kiani, Jesper Tegnér
In estimating the complexity of objects, in particular of graphs, it is common practice to rely on graph- and information-theoretic measures. Here, using integer sequences with pro…
Numerical Investigation of Graph Spectra and Information Interpretability of Eigenvalues
Hector Zenil, Narsis A. Kiani, Jesper Tegnér
We undertake an extensive numerical investigation of the graph spectra of thousands regular graphs, a set of random Erdös-Rényi graphs, the two most popular types of complex networ…