11 citations · 12 across the 10 of their papers we have counts for
Showing cs.ITShow all
2 papers · 1 filter
cs.IT2024★ 1 cited
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…
cs.IT2015
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…