{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,15]],"date-time":"2024-04-15T06:40:50Z","timestamp":1713163250925},"reference-count":40,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2011,12,1]],"date-time":"2011-12-01T00:00:00Z","timestamp":1322697600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2012,1]]},"abstract":"Abstract<\/jats:title>Network or graph structures are ubiquitous in the study of complex systems. Often, we are interested in complexity trends of these system as it evolves under some dynamic. An example might be looking at the complexity of a food web as species enter an ecosystem via migration or speciation, and leave via extinction. In a previous article, a complexity measure of networks was proposed based on the \u201ccomplexity is information content\u201d paradigm. To apply this paradigm to any object, one must fix two things: a representation language, in which strings of symbols from some alphabet describe, or stand for the objects being considered; and a means of determining when two such descriptions refer to the same object. With these two things set, the information content of an object can be computed in principle from the number of equivalent descriptions describing a particular object. The previously proposed representation language had the deficiency that the fully connected and empty networks were the most complex for a given number of nodes. A variation of this measure, called zcomplexity, applied a compression algorithm to the resulting bitstring representation, to solve this problem. Unfortunately, zcomplexity proved too computationally expensive to be practical. In this article, I propose a new representation language that encodes the number of links along with the number of nodes and a representation of the linklist. This, like zcomplexity, exhibits minimal complexity for fully connected and empty networks, but is as tractable as the original measure. This measure is extended to directed and weighted links, and several real\u2010world networks have their network complexities compared with randomly generated model networks with matched node and link counts, and matched link weight distributions. When compared with the random networks, the real\u2010world networks have significantly higher complexity, as do artificially generated food webs created via an evolutionary process, in several well\u2010known ALife models. \u00a9 2011 Wiley Periodicals, Inc. Complexity, 2011<\/jats:p>","DOI":"10.1002\/cplx.20393","type":"journal-article","created":{"date-parts":[[2011,12,2]],"date-time":"2011-12-02T22:17:20Z","timestamp":1322864240000},"page":"50-61","source":"Crossref","is-referenced-by-count":10,"title":["Complexity of networks (Reprise)"],"prefix":"10.1002","volume":"17","author":[{"given":"Russell K.","family":"Standish","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2011,12]]},"reference":[{"key":"e_1_2_11_2_2","doi-asserted-by":"publisher","DOI":"10.1002\/cplx.20249"},{"key":"e_1_2_11_3_2","first-page":"9","article-title":"On complexity and emergence","author":"Standish R.K.","year":"2001","journal-title":"Complex Int"},{"key":"e_1_2_11_4_2","unstructured":"Edmonds B.Syntactic Measures of Complexity Ph.D. thesis University of Manchester 1999.http:\/\/bruce.edmonds.name\/thesis\/ Complexity Bibliography:http:\/\/bruce.edmonds.name\/compbib\/."},{"key":"e_1_2_11_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2606-0"},{"key":"e_1_2_11_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2006.08.067"},{"key":"e_1_2_11_7_2","series-title":"Recent Advances in Artificial Life","first-page":"253","volume-title":"Advances in Natural Computation","author":"Standish R.K.","year":"2005"},{"key":"e_1_2_11_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2007.06.029"},{"key":"e_1_2_11_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2008.01.015"},{"key":"e_1_2_11_10_2","first-page":"45","article-title":"Practical graph isomorphism","volume":"30","author":"McKay B.D.","year":"1981","journal-title":"Congressus Numerantium"},{"key":"e_1_2_11_11_2","first-page":"23","volume-title":"Entropy, Information and Evolution","author":"Layzer D.","year":"1988"},{"key":"e_1_2_11_12_2","doi-asserted-by":"publisher","DOI":"10.1088\/0305-4470\/36\/3\/303"},{"key":"e_1_2_11_13_2","volume-title":"From Being into Becoming","author":"Prigogine I.","year":"1980"},{"key":"e_1_2_11_14_2","doi-asserted-by":"publisher","DOI":"10.1162\/106454600300103683"},{"key":"e_1_2_11_15_2","doi-asserted-by":"publisher","DOI":"10.1142\/S1469026803000914"},{"key":"e_1_2_11_16_2","first-page":"51","volume-title":"A Life IX Workshop and Tutorial Proceedings","author":"Standish R.K.","year":"2004"},{"key":"e_1_2_11_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(01)00141-7"},{"key":"e_1_2_11_18_2","first-page":"323","volume-title":"Proceedings of the Artificial Life XII","author":"Dorin A.","year":"2010"},{"key":"e_1_2_11_19_2","doi-asserted-by":"publisher","DOI":"10.1162\/artl.2008.14.3.14301"},{"key":"e_1_2_11_20_2","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"e_1_2_11_21_2","volume-title":"The Stanford GraphBase: A Platform for Combinatorial Computing","author":"Knuth D.E.","year":"1993"},{"key":"e_1_2_11_22_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.74.036104"},{"key":"e_1_2_11_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3800(99)00022-8"},{"key":"e_1_2_11_24_2","unstructured":"Ulanowicz R.;Bondavalli C.;Egnotovich M.Network analysis of trophic dynamics in South Florida ecosystem FY 97: The Florida Bay ecosystem Technical report [UMCES]CBL 98\u2013123 Chesapeake Biological Laboratory Solomons MD 1998."},{"key":"e_1_2_11_25_2","unstructured":"Ulanowicz R.;Heymans J.;Egnotovich M.Network analysis of trophic dynamics in South Florida ecosystems FY 99: The graminoid ecosystem Technical report [UMCES] CBL 00\u20100176 Chesapeake Biological Laboratory Solomons MD 2000."},{"key":"e_1_2_11_26_2","unstructured":"Hagy J.Eutrophication hypoxia and trophic transfer efficiency in Chesapeake Bay Ph.D. thesis University of Maryland at College Park 2002."},{"key":"e_1_2_11_27_2","doi-asserted-by":"publisher","DOI":"10.1006\/ecss.1998.0360"},{"key":"e_1_2_11_28_2","doi-asserted-by":"publisher","DOI":"10.1006\/ecss.1999.0503"},{"key":"e_1_2_11_29_2","doi-asserted-by":"publisher","DOI":"10.2307\/1943071"},{"key":"e_1_2_11_30_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.72.027104"},{"key":"e_1_2_11_31_2","doi-asserted-by":"publisher","DOI":"10.1038\/35075138"},{"key":"e_1_2_11_32_2","doi-asserted-by":"publisher","DOI":"10.1137\/070710111"},{"key":"e_1_2_11_33_2","doi-asserted-by":"publisher","DOI":"10.3354\/meps161239"},{"key":"e_1_2_11_34_2","first-page":"371","volume-title":"An approach to the synthesis of life. In: Artificial Life II","author":"Ray T.","year":"1991"},{"key":"e_1_2_11_35_2","first-page":"2","article-title":"Population models with random embryologies as a paradigm for evolution","author":"Standish R.K.","year":"1994","journal-title":"Complex Int"},{"key":"e_1_2_11_36_2","series-title":"Commerce, Complexity and Evolution","first-page":"61","volume-title":"International Symposia in Economic Theory and Econometrics","author":"Standish R.K.","year":"2000"},{"key":"e_1_2_11_37_2","doi-asserted-by":"publisher","DOI":"10.1006\/jtbi.1998.0706"},{"key":"e_1_2_11_38_2","doi-asserted-by":"publisher","DOI":"10.1006\/jtbi.2000.2203"},{"key":"e_1_2_11_39_2","doi-asserted-by":"crossref","first-page":"358","DOI":"10.7551\/mitpress\/1429.003.0060","volume-title":"Artificial Life IX","author":"Standish R.K.","year":"2004"},{"key":"e_1_2_11_40_2","first-page":"337","volume-title":"Network complexity of foodwebs. In: Proceedings of Artificial XII","author":"Standish R.K.","year":"2010"},{"key":"e_1_2_11_41_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fcplx.20393","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/cplx.20393","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,15]],"date-time":"2024-04-15T06:04:58Z","timestamp":1713161098000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/cplx.20393"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["10.1002\/cplx.20393"],"URL":"https:\/\/doi.org\/10.1002\/cplx.20393","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"value":"1076-2787","type":"print"},{"value":"1099-0526","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12]]}}}