TY - BOOK T1 - Unifying Themes in Complex Systems IX: Proceedings of the Ninth International Conference on Complex Systems T2 - Springer Proceedings in Complexity Y1 - 2018 ED - Alfredo J. Morales ED - Carlos Gershenson ED - Dan Braha ED - Ali A. Minai ED - Yaneer Bar-Yam JF - Springer Proceedings in Complexity PB - Springer CY - Cambridge, MA, USA UR - https://link.springer.com/book/10.1007/978-3-319-96661-8 ER - TY - JOUR T1 - Urban Transfer Entropy across Scales JF - PLoS ONE Y1 - 2015 A1 - Murcio, Roberto A1 - Morphet, Robin A1 - Gershenson, Carlos A1 - Batty, Michael AB -

The morphology of urban agglomeration is studied here in the context of information exchange between different spatio-temporal scales. Urban migration to and from cities is characterised as non-random and following non-random pathways. Cities are multidimensional non-linear phenomena, so understanding the relationships and connectivity between scales is important in determining how the interplay of local/regional urban policies may affect the distribution of urban settlements. In order to quantify these relationships, we follow an information theoretic approach using the concept of Transfer Entropy. Our analysis is based on a stochastic urban fractal model, which mimics urban growing settlements and migration waves. The results indicate how different policies could affect urban morphology in terms of the information generated across geographical scales.

VL - 10 UR - http://dx.doi.org/10.1371%2Fjournal.pone.0133780 ER - TY - CONF T1 - Updating Schemes in Random {Boolean} Networks: Do They Really Matter? T2 - Artificial Life {IX} Proceedings of the Ninth International Conference on the Simulation and Synthesis of Living Systems Y1 - 2004 A1 - Carlos Gershenson ED - J. Pollack ED - M. Bedau ED - P. Husbands ED - T. Ikegami ED - R. A. Watson AB - In this paper we try to end the debate concerning the suitability of different updating schemes in random Boolean networks (RBNs). We quantify for the first time loose attractors in asyncrhonous RBNs, which allows us to analyze the complexity reduction related to different updating schemes. We also report that all updating schemes yield very similar critical stability values, meaning that the "edge of chaos" does not depend much on the updating scheme. After discussion, we conclude that synchonous RBNs are justifiable theoretical models of biological networks. JF - Artificial Life {IX} Proceedings of the Ninth International Conference on the Simulation and Synthesis of Living Systems PB - MIT Press UR - http://arxiv.org/abs/nlin.AO/0402006 ER -