Numerical Investigation of Graph Spectra and Information Interpretability of Eigenvalues

We undertake an extensive numerical investigation of the graph spectra of thousands regular graphs, a set of random Erd\"os-R\'enyi graphs, the two most popular types of complex networks and an evolving genetic network by using novel conceptual and experimental tools. Our objective in so doing is to contribute to an understanding of the meaning of the Eigenvalues of a graph relative to its topological and information-theoretic properties. We introduce a technique for identifying the most informative Eigenvalues of evolving networks by comparing graph spectra behavior to their algorithmic complexity. We suggest that extending techniques can be used to further investigate the behavior of evolving biological networks. In the extended version of this paper we apply these techniques to seven tissue specific regulatory networks as static example and network of a na\"ive pluripotent immune cell in the process of differentiating towards a Th17 cell as evolving example, finding the most and least informative Eigenvalues at every stage.

[1]  Jean-Paul Delahaye,et al.  Two-Dimensional Kolmogorov Complexity and Validation of the Coding Theorem Method by Compressibility , 2012, ArXiv.

[2]  Adolfo Piperno,et al.  Search Space Contraction in Canonical Labeling of Graphs (Preliminary Version) , 2008, ArXiv.

[3]  Ray J. Solomonoff,et al.  A Formal Theory of Inductive Inference. Part II , 1964, Inf. Control..

[4]  William I. Gasarch,et al.  Book Review: An introduction to Kolmogorov Complexity and its Applications Second Edition, 1997 by Ming Li and Paul Vitanyi (Springer (Graduate Text Series)) , 1997, SIGACT News.

[5]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[6]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[7]  Z. Neda,et al.  Networks in life: Scaling properties and eigenvalue spectra , 2002, cond-mat/0303106.

[8]  Steven Skiena,et al.  Implementing discrete mathematics - combinatorics and graph theory with Mathematica , 1990 .

[9]  Cristian S. Calude.  Information and Randomness: An Algorithmic Perspective , 1994 .

[10]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[11]  Jean-Paul Delahaye,et al.  Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines , 2012, PloS one.

[12]  Hector Zenil,et al.  Correlation of automorphism group size and topological properties with program−size complexity evaluations of graphs and complex networks , 2013, 1306.0322.

[13]  Jean-Paul Delahaye,et al.  Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility , 2012, PeerJ Comput. Sci..

[14]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.

[15]  Hector Zenil,et al.  Algorithmic complexity of motifs clusters superfamilies of networks , 2013, 2013 IEEE International Conference on Bioinformatics and Biomedicine.

[16]  Jean-Paul Delahaye,et al.  Numerical evaluation of algorithmic complexity for short strings: A glance into the innermost structure of randomness , 2011, Appl. Math. Comput..

[17]  Hector Zenil,et al.  Methods of information theory and algorithmic complexity for network biology. , 2014, Seminars in cell & developmental biology.

[18]  Gregory J. Chaitin,et al.  On the Length of Programs for Computing Finite Binary Sequences , 1966, JACM.

[19]  A. Kolmogorov.  Three approaches to the quantitative definition of information , 1968 .

[20]  Béla Bollobás,et al.  Random Graphs , 1985 .

[21]  Cristian Claude,et al.  Information and Randomness: An Algorithmic Perspective , 1994 .