{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T18:13:16Z","timestamp":1725819196840},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319164793"},{"type":"electronic","value":"9783319164809"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-16480-9_39","type":"book-chapter","created":{"date-parts":[[2015,3,16]],"date-time":"2015-03-16T11:09:53Z","timestamp":1426504193000},"page":"395-405","source":"Crossref","is-referenced-by-count":2,"title":["Numerical Investigation of Graph Spectra and Information Interpretability of Eigenvalues"],"prefix":"10.1007","author":[{"given":"Hector","family":"Zenil","sequence":"first","affiliation":[]},{"given":"Narsis A.","family":"Kiani","sequence":"additional","affiliation":[]},{"given":"Jesper","family":"Tegn\u00e9r","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0378-4371(02)01181-0","volume":"314","author":"I. Farkasa","year":"2002","unstructured":"Farkasa, I., Derenyia, I., Jeongc, H., Nedac, Z., Oltvaie, Z.N., Ravaszc, E., Schubertf, A., Barabasi, A.L., Vicseka, T.: Networks in life: scaling properties and eigenvalue spectra. Physica A\u00a0314, 25\u201334 (2002)","journal-title":"Physica A"},{"key":"39_CR2","unstructured":"Calude, C.S.: Information and Randomness: An Algorithmic Perspective, 2nd edn. EATCS Series. Springer (2010)"},{"issue":"4","key":"39_CR3","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1145\/321356.321363","volume":"13","author":"G.J. Chaitin","year":"1966","unstructured":"Chaitin, G.J.: On the length of programs for computing finite binary sequences. Journal of the ACM\u00a013(4), 547\u2013569 (1966)","journal-title":"Journal of the ACM"},{"key":"39_CR4","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory, 2nd edn. Wiley-Blackwell (2009)"},{"key":"39_CR5","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.amc.2011.10.006","volume":"219","author":"J.-P. Delahaye","year":"2012","unstructured":"Delahaye, J.-P., Zenil, H.: Numerical Evaluation of the Complexity of Short Strings: A Glance Into the Innermost Structure of Algorithmic Randomness. Applied Mathematics and Computation\u00a0219, 63\u201377 (2012)","journal-title":"Applied Mathematics and Computation"},{"key":"39_CR6","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P. Erd\u00f6s","year":"1959","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: On Random Graphs I. Publ. Math. Debrecen\u00a06, 290\u2013297 (1959)","journal-title":"Publ. Math. Debrecen"},{"key":"39_CR7","doi-asserted-by":"crossref","unstructured":"Gilbert, E.N.: Random graphs. Annals of Mathematical Statistics 30, 1141\u20131144","DOI":"10.1214\/aoms\/1177706098"},{"issue":"1","key":"39_CR8","first-page":"1","volume":"1","author":"A.N. Kolmogorov","year":"1965","unstructured":"Kolmogorov, A.N.: Three approaches to the quantitative definition of information. Problems of Information and Transmission\u00a01(1), 1\u20137 (1965)","journal-title":"Problems of Information and Transmission"},{"issue":"3","key":"39_CR9","first-page":"206","volume":"10","author":"L.A. Levin","year":"1974","unstructured":"Levin, L.A.: Laws of information conservation (non-growth) and aspects of the foundation of probability theory. Problems of Information Transmission\u00a010(3), 206\u2013210 (1974)","journal-title":"Problems of Information Transmission"},{"key":"39_CR10","doi-asserted-by":"crossref","unstructured":"Li, M., Vit\u00e1nyi, P.: An Introduction to Kolmogorov Complexity and Its Applications, 3rd edn. Springer (2009)","DOI":"10.1007\/978-0-387-49820-1"},{"key":"39_CR11","unstructured":"Piperno, A.: Search Space Contraction in Canonical Labeling of Graphs (Preliminary Version), CoRR abs\/0804.4881 (2008)"},{"key":"39_CR12","first-page":"181","volume-title":"Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica","author":"S. Skiena","year":"1990","unstructured":"Skiena, S.: Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica, pp. 181\u2013187. Addison-Wesley, Reading (1990)"},{"key":"39_CR13","doi-asserted-by":"crossref","unstructured":"Soler-Toscano, F., Zenil, H., Delahaye, J.-P., Gauvrit, N.: Calculating Kolmogorov Complexity from the Frequency Output Distributions of Small Turing Machines. PLoS One\u00a09(5), e96223 (2014)","DOI":"10.1371\/journal.pone.0096223"},{"key":"39_CR14","doi-asserted-by":"crossref","unstructured":"Solomonoff, R.J.: A formal theory of inductive inference: Parts 1 and 2. Information and Control 7,1\u201322, 224\u2013254 (1964)","DOI":"10.1016\/S0019-9958(64)90131-7"},{"key":"39_CR15","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"D.J. Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2018small-world\u2019 networks. Nature\u00a0393, 440\u2013442 (1998)","journal-title":"Nature"},{"key":"39_CR16","unstructured":"Zenil, H.: Network Motifs and Graphlets Wolfram Demonstrations Project (December 9, 2013), http:\/\/demonstrations.wolfram.com\/NetworkMotifsAndGraphlets\/"},{"key":"39_CR17","doi-asserted-by":"crossref","unstructured":"Zenil, H., Soler-Toscano, F., Dingle, K., Louis, A.: Graph Automorphisms and Topological Characterization of Complex Networks by Algorithmic Information Content, Physica A: Statistical Mechanics and its Applications\u00a0404, 341\u2013358 (2014)","DOI":"10.1016\/j.physa.2014.02.060"},{"key":"39_CR18","unstructured":"Zenil, H., Soler-Toscano, F., Delahaye, J.-P., Gauvrit, N.: Two-Dimensional Kolmogorov Complexity and Validation of the Coding Theorem Method by Compressibility (2013)"},{"key":"39_CR19","unstructured":"Zenil, H., Kiani, N.A., Tegn\u00e9r, J.: Methods of Information Theory and Algorithmic Complexity for Network Biology (submitted to journal), arXiv:1401.3604 [q-bio.MN]"},{"key":"39_CR20","doi-asserted-by":"crossref","unstructured":"Zenil, H., Kiani, N.A., Tegn\u00e9r, J.: Algorithmic complexity of motifs clusters superfamilies of networks. In: Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, Shanghai, China (2013)","DOI":"10.1109\/BIBM.2013.6732768"}],"container-title":["Lecture Notes in Computer Science","Bioinformatics and Biomedical Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-16480-9_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T16:45:12Z","timestamp":1691513112000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-16480-9_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319164793","9783319164809"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-16480-9_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}