Publications 2016

​Methods of information theory and algorithmic complexity for network biology
H. Zenil, N. Kiani, J. Tegnér
Seminars of Developmental and Cell Biology March 51: 32-43, 2016
H. Zenil, N. Kiani, J. Tegnér
Algorithmic probability; Algorithmic randomness; Biological networks; Complex networks; Information theory; Kolmogorov complexity
2016
​We survey and introduce concepts and tools located at the intersection of information theory and network biology. We show that Shannon's information entropy, compressibility and algorithmic complexity quantify different local and global aspects of synthetic and biological data. We show examples such as the emergence of giant components in Erdös-Rényi random graphs, and the recovery of topological properties from numerical kinetic properties simulating gene expression data. We provide exact theoretical calculations, numerical approximations and error estimations of entropy, algorithmic probability and Kolmogorov complexity for different types of graphs, characterizing their variant and invariant properties. We introduce formal definitions of complexity for both labeled and unlabeled graphs and prove that the Kolmogorov complexity of a labeled graph is a good approximation of its unlabeled Kolmogorov complexity and thus a robust definition of graph complexity.



DOI: 10.1016/j.semcdb.2016.01.011


Methods of information theory and algorithmic complexity for network biology.pdfMethods of information theory and algorithmic complexity for network biology.pdf
Preprint PDF
Early Version PDF