@book {ICCS2018,
	title = {Unifying Themes in Complex Systems IX: Proceedings of the Ninth International Conference on Complex Systems},
	series = {Springer Proceedings in Complexity},
	year = {2018},
	publisher = {Springer},
	organization = {Springer},
	address = {Cambridge, MA, USA},
	url = {https://link.springer.com/book/10.1007/978-3-319-96661-8},
	editor = {Alfredo J. Morales and Carlos Gershenson and Dan Braha and Ali A. Minai and Yaneer Bar-Yam}
}
@article {157,
	title = {Urban Transfer Entropy across Scales},
	journal = {PLoS ONE},
	volume = {10},
	year = {2015},
	month = {07},
	pages = {e0133780},
	abstract = {<p>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.</p>},
	doi = {10.1371/journal.pone.0133780},
	url = {http://dx.doi.org/10.1371\%2Fjournal.pone.0133780},
	author = {Murcio, Roberto and Morphet, Robin and Gershenson, Carlos and Batty, Michael}
}
@conference {Gershenson2004b,
	title = {Updating Schemes in Random {Boolean} Networks: Do They Really Matter?},
	booktitle = {Artificial Life {IX} Proceedings of the Ninth International Conference on the Simulation and Synthesis of Living Systems},
	year = {2004},
	pages = {238{\textendash}243},
	publisher = {MIT Press},
	organization = {MIT Press},
	abstract = {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.},
	url = {http://arxiv.org/abs/nlin.AO/0402006},
	author = {Carlos Gershenson},
	editor = {J. Pollack and M. Bedau and P. Husbands and T. Ikegami and R. A. Watson}
}
