%0 Journal Article %J Complexity %D 2020 %T Forecasting of Population Narcotization under the Implementation of a Drug Use Reduction Policy %A Mityagin, Sergey %A Gershenson, Carlos %A Boukhanovsky, Alexander %X In this paper, we present an approach to drug addiction simulation and forecasting in the medium and long terms in cities having a high population density and a high rate of social communication. Drug addiction forecasting is one of the basic components of the antidrug policy, giving informational and analytic support both at the regional and at the governmental level. However, views on the drug consumption problem vary in different regions, and as a consequence, several approaches to antidrug policy implementation exist. Thereby, notwithstanding the fact that the phenomenology of the population narcotization process is similar in the different regions, approaches to the modeling of drug addiction may also substantially differ for different kinds of antidrug policies. This paper presents a survey of the available antidrug policies and the corresponding approaches to the simulation of population narcotization. This article considers the approach to the construction of the regression model of anesthesia on the main components formed on the basis of indicators of social and economic development. The substantiation of the chosen method is given, which is associated with a significant correlation of indicators, which characterizes the presence of a small number of superfactors. This allows us to form a conclusion about the general level of development of the region as the main factor determining the drug addiction. A new model is proposed for one of the most widespread antidrug policies, namely, the drug use reduction policy. The model helps determine the significant factors of population narcotization and allows to estimate its damage. The model is tested successfully using St. Petersburg data. %B Complexity %V 2020 %P 1–14 %G eng %R 10.1155/2020/9135024 %0 Unpublished Work %D 2019 %T Complexity Explained: A Grassroot Collaborative Initiative to Create a Set of Essential Concepts of Complex Systems. %A Manlio De Domenico %A Chico Camargo %A Carlos Gershenson %A Daniel Goldsmith %A Sabine Jeschonnek %A Lorren Kay %A Stefano Nichele %A José Nicolás %A Thomas Schmickl %A Massimo Stella %A Josh Brandoff %A Ángel José Martínez Salinas %A Hiroki Sayama %X Complexity science, also called complex systems science, studies how a large collection of components – locally interacting with each other at small scales – can spontaneously self-organize to exhibit non-trivial global structures and behaviors at larger scales, often without external intervention, central authorities or leaders. The properties of the collection may not be understood or predicted from the full knowledge of its constituents alone. Such a collection is called a complex system and it requires new mathematical frameworks and scientific methodologies for its investigation. %G eng %U https://complexityexplained.github.io %R 10.17605/OSF.IO/TQGNW %0 Journal Article %J Future Generation Computer Systems %D 2018 %T Multimodel agent-based simulation environment for mass-gatherings and pedestrian dynamics %A Vladislav Karbovskii %A Daniil Voloshin %A Andrey Karsakov %A Alexey Bezgodov %A Carlos Gershenson %X Abstract The increasing interest in complex phenomena, especially in crowd and pedestrian dynamics, has conditioned the demand not only for more sophisticated autonomous models but also for mechanisms that would bring these models together. This paper presents a multimodel agent-based simulation technique based on the incorporation of multiple modules. Two key principles are presented to guide this integration: a common abstract space where entities of different models interact, and commonly controlled agents–-abstract actors operating in the common space, which can be handled by different agent-based models. In order to test the proposed methodology, we run a set of simulations of cinema building evacuation using the general-purpose {PULSE} simulation environment. In this paper we utilize crowd pressure as a metric to estimate the capacity of different emergent conditions to traumatically affect pedestrians in the crowd. The proposed approach is evaluated through a series of experiments simulating the emergency evacuation from a cinema building to the city streets, where building and street levels are reproduced in heterogeneous models. This approach paves the way for modeling realistic city-wide evacuations. %B Future Generation Computer Systems %V 79 %P 155–165 %8 February %G eng %U http://dx.doi.org/10.1016/j.future.2016.10.002 %R 10.1016/j.future.2016.10.002 %0 Book %B Springer Proceedings in Complexity %D 2018 %T Unifying Themes in Complex Systems IX: Proceedings of the Ninth International Conference on Complex Systems %E Alfredo J. Morales %E Carlos Gershenson %E Dan Braha %E Ali A. Minai %E Yaneer Bar-Yam %B Springer Proceedings in Complexity %I Springer %C Cambridge, MA, USA %G eng %U https://link.springer.com/book/10.1007/978-3-319-96661-8 %0 Unpublished Work %D 2017 %T Self-Organization in Traffic Lights: Evolution of Signal Control with Advances in Sensors and Communications %A Goel, Sanjay %A Bush, Stephen F %A Gershenson, Carlos %G eng %U https://arxiv.org/abs/1708.07188 %0 Journal Article %J Future Generation Computer Systems %D 2016 %T Multimodel agent-based simulation environment for mass-gatherings and pedestrian dynamics %A Vladislav Karbovskii %A Daniil Voloshin %A Andrey Karsakov %A Alexey Bezgodov %A Carlos Gershenson %K Urgent computing %X Abstract The increasing interest in complex phenomena, especially in crowd and pedestrian dynamics, has conditioned the demand not only for more sophisticated autonomous models but also for mechanisms that would bring these models together. This paper presents a multimodel agent-based simulation technique based on the incorporation of multiple modules. Two key principles are presented to guide this integration: a common abstract space where entities of different models interact, and commonly controlled agents–-abstract actors operating in the common space, which can be handled by different agent-based models. In order to test the proposed methodology, we run a set of simulations of cinema building evacuation using the general-purpose \{PULSE\} simulation environment. In this paper we utilize crowd pressure as a metric to estimate the capacity of different emergent conditions to traumatically affect pedestrians in the crowd. The proposed approach is evaluated through a series of experiments simulating the emergency evacuation from a cinema building to the city streets, where building and street levels are reproduced in heterogeneous models. This approach paves the way for modeling realistic city-wide evacuations. %B Future Generation Computer Systems %P - %G eng %U http://dx.doi.org/10.1016/j.future.2016.10.002 %R 10.1016/j.future.2016.10.002 %0 Book Section %B Estado del Arte de la Medicina 2013-2014: Las ciencias de la complejidad y la innovación médica: Aplicaciones %D 2015 %T Hacia un sistema de salud autoorganizante y emergente %A Carlos Gershenson %E Enrique Ruelas Barajas %E Ricardo Mansilla Corona %B Estado del Arte de la Medicina 2013-2014: Las ciencias de la complejidad y la innovación médica: Aplicaciones %I Academia Nacional de Medicina %C Mexico %P 245–254 %G eng %0 Journal Article %J PLoS ONE %D 2015 %T Urban Transfer Entropy across Scales %A Murcio, Roberto %A Morphet, Robin %A Gershenson, Carlos %A Batty, Michael %X

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.

%B PLoS ONE %V 10 %P e0133780 %8 07 %G eng %U http://dx.doi.org/10.1371%2Fjournal.pone.0133780 %R 10.1371/journal.pone.0133780 %0 Book Section %B Actualidades en el manejo del dolor y cuidados paliativos %D 2014 %T Dolor, placebos y complejidad %A Carlos Gershenson %A Javier Rosado %E Bistre-Cohén, Sara %B Actualidades en el manejo del dolor y cuidados paliativos %I Editorial Alfil %C Mexico %G eng %& 36 %0 Journal Article %J Frontiers in Robotics and AI %D 2014 %T The Past, Present, and Future of Artificial Life %A Aguilar, Wendy %A Santamaría Bonfil, Guillermo %A Froese, Tom %A Gershenson, Carlos %X

For millennia people have wondered what makes the living different from the non-living. Beginning in the mid-1980s, artificial life has studied living systems using a synthetic approach: build life in order to understand it better, be it by means of software, hardware, or wetware. This review provides a summary of the advances that led to the development of artificial life, its current research topics, and open problems and opportunities. We classify artificial life research into fourteen themes: origins of life, autonomy, self-organization, adaptation (including evolution, development, and learning), ecology, artificial societies, behavior, computational biology, artificial chemistries, information, living technology, art, and philosophy. Being interdisciplinary, artificial life seems to be losing its boundaries and merging with other fields.

%B Frontiers in Robotics and AI %V 1 %G eng %U http://www.frontiersin.org/computational_intelligence/10.3389/frobt.2014.00008/abstract %R 10.3389/frobt.2014.00008 %0 Book Section %B Complexity Perspectives on Language, Communication and Society %D 2013 %T Facing Complexity: Prediction vs. Adaptation %A Carlos Gershenson %E Massip, A. %E A. Bastardas %X One of the presuppositions of science since the times of Galileo, Newton, Laplace, and Descartes has been the predictability of the world. This idea has strongly influenced scientific and technological models. However, in recent decades, chaos and complexity have shown that not every phenomenon is predictable, even if it is deterministic. If a problem space is predictable, in theory we can find a solution via optimization. Nevertheless, if a problem space is not predictable, or it changes too fast, very probably optimization will offer obsolete solutions. This occurs often when the immediate solution affects the problem itself. An alternative is found in adaptation. An adaptive system will be able to find by itself new solutions for unforeseen situations. %B Complexity Perspectives on Language, Communication and Society %I Springer %C Berlin Heidelberg %P 3-14 %@ 978-3-642-32816-9 %G eng %U http://arxiv.org/abs/1112.3843 %R 10.1007/978-3-642-32817-6 %0 Book Section %B Unifying Themes in Complex Systems %D 2012 %T The World as Evolving Information %A Carlos Gershenson %E Minai, Ali %E Braha, Dan %E Yaneer {Bar-Yam} %X This paper discusses the benefits of describing the world as information, especially in the study of the evolution of life and cognition. Traditional studies encounter problems because it is difficult to describe life and cognition in terms of matter and energy, since their laws are valid only at the physical scale. However, if matter and energy, as well as life and cognition, are described in terms of information, evolution can be described consistently as information becoming more complex. The paper presents five tentative laws of information, valid at multiple scales, which are generalizations of Darwinian, cybernetic, thermodynamic, and complexity principles. These are further used to discuss the notions of life and cognition and their evolution. %B Unifying Themes in Complex Systems %I Springer %C Berlin Heidelberg %V VII %P 100-115 %G eng %U http://arxiv.org/abs/0704.0304 %R 10.1007/978-3-642-18003-3_10 %0 Book Section %B Unifying Themes in Complex Systems %D 2011 %T Protocol Requirements for Self-Organizing Artifacts: Towards an Ambient Intelligence %A Carlos Gershenson %A Francis Heylighen %E Minai, Ali %E Braha, Dan %E Yaneer {Bar-Yam} %X We discuss which properties common-use artifacts should have to collaborate without human intervention. We conceive how devices, such as mobile phones, PDAs, and home appliances, could be seamlessly integrated to provide an "ambient intelligence" that responds to the users desires without requiring explicit programming or commands. While the hardware and software technology to build such systems already exists, yet there is no protocol to direct and give meaning to their interactions. We propose the first steps in the development of such a protocol, which would need to be adaptive, extensible, and open to the community, while promoting self-organization. We argue that devices, interacting through "game-like" moves, can learn to agree about how to communicate, with whom to cooperate, and how to delegate and coordinate specialized tasks. Like this, they may evolve distributed cognition or collective intelligence able to tackle any complex of tasks. %B Unifying Themes in Complex Systems %I Springer %C Berlin Heidelberg %V V %P 136-143 %G eng %U http://arxiv.org/abs/nlin.AO/0404004 %R 10.1007/978-3-642-17635-7_17 %0 Book %B Lecture Notes in Computer Science %D 2011 %T Self-Organizing Systems 5th International Workshop, IWSOS 2011, Karlsruhe, Germany, February 23-24, 2011, Proceedings. Springer LNCS 6557 %E Christian Bettstetter %E Carlos Gershenson %X This book constitutes the refereed proceedings of the 5th International Workshop on Self-Organizing Systems, IWSOS 2011, held in Karlsruhe, Germany, in February 2011. The 9 revised full papers presented together with 1 invited paper were carefully selected from 25 initial submissions. It was the 5th workshop in a series of multidisciplinary events dedicated to self-organization in networked systems with main focus on communication and computer networks. The papers address theoretical aspects of self-organization as well as applications in communication and computer networks and robot networks. %B Lecture Notes in Computer Science %I Springer %V 6557 %@ 978-3-642-19166-4 %G eng %U http://dx.doi.org/10.1007/978-3-642-19167-1 %R 10.1007/978-3-642-19167-1 %0 Book Section %B Complexity, Science and Society %D 2007 %T Complexity and Philosophy %A Francis Heylighen %A Paul Cilliers %A Carlos Gershenson %E Jan Bogg %E Robert Geyer %B Complexity, Science and Society %I Radcliffe Publishing %C Oxford %P 117-134 %G eng %U http://arxiv.org/abs/cs.CC/0604072 %0 Conference Paper %B Hawaii International Conference on Systems Science (HICSS) %D 2007 %T Smartocracy: Social Networks for Collective Decision Making %A Rodriguez, Marko A. %A Steinbock, Daniel J. %A Watkins, Jennifer H. %A Gershenson, Carlos %A Bollen, Johan %A Grey, Victor %A deGraf, Brad %X Smartocracy is a social software system for collec- tive decision making. The system is composed of a social network that links individuals to those they trust to make good decisions and a decision network that links individuals to their voted-on solutions. Such networks allow a variety of algorithms to convert the link choices made by individual participants into specific decision outcomes. Simply interpreting the linkages differently (e.g. ignoring trust links, or using them to weight an individual's vote) provides a variety of outcomes fit for different decision making scenarios. This paper will discuss the Smartocracy network data structures, the suite of collective decision making algorithms currently supported, and the results of two collective decisions regarding the design of the system. %B Hawaii International Conference on Systems Science (HICSS) %I IEEE Computer Society %G eng %U http://tinyurl.com/ybojp8 %R 10.1109/HICSS.2007.484 %0 Book Section %B Complexity, Science and Society %D 2007 %T Towards a General Methodology for Designing Self-Organizing Systems %A Carlos Gershenson %E Jan Bogg %E Robert Geyer %B Complexity, Science and Society %I Radcliffe Publishing %C Oxford %G eng %0 Conference Paper %B {Artificial Life X}, Proceedings of the Tenth International Conference on the Simulation and Synthesis of Living Systems. %D 2006 %T The Role of Redundancy in the Robustness of Random {Boolean} Networks %A Carlos Gershenson %A Stuart A. Kauffman %A Ilya Shmulevich %E Rocha, L. M. %E L. S. Yaeger %E M. A. Bedau %E D. Floreano %E R. L. Goldstone %E A. Vespignani %X Evolution depends on the possibility of successfully exploring fitness landscapes via mutation and recombination. With these search procedures, exploration is difficult in "rugged" fitness landscapes, where small mutations can drastically change functionalities in an organism. Random Boolean networks (RBNs), being general models, can be used to explore theories of how evolution can take place in rugged landscapes; or even change the landscapes. In this paper, we study the effect that redundant nodes have on the robustness of RBNs. Using computer simulations, we have found that the addition of redundant nodes to RBNs increases their robustness. We conjecture that redundancy is a way of "smoothening" fitness landscapes. Therefore, redundancy can facilitate evolutionary searches. However, too much redundancy could reduce the rate of adaptation of an evolutionary process. Our results also provide supporting evidence in favour of Kauffman's conjecture (Kauffman, 2000, p.195). %B {Artificial Life X}, Proceedings of the Tenth International Conference on the Simulation and Synthesis of Living Systems. %I MIT Press %P 35–42 %G eng %U http://uk.arxiv.org/abs/nlin.AO/0511018 %0 Conference Paper %B Workshop and Tutorial Proceedings, Ninth International Conference on the Simulation and Synthesis of Living Systems {(ALife} {IX)} %D 2004 %T Introduction to Random {Boolean} Networks %A Carlos Gershenson %E M. Bedau %E P. Husbands %E T. Hutton %E S. Kumar %E H. Suzuki %X The goal of this tutorial is to promote interest in the study of random Boolean networks (RBNs). These can be very interesting models, since one does not have to assume any functionality or particular connectivity of the networks to study their generic properties. Like this, RBNs have been used for exploring the configurations where life could emerge. The fact that RBNs are a generalization of cellular automata makes their research a very important topic. The tutorial, intended for a broad audience, presents the state of the art in RBNs, spanning over several lines of research carried out by different groups. We focus on research done within artificial life, as we cannot exhaust the abundant research done over the decades related to RBNs. %B Workshop and Tutorial Proceedings, Ninth International Conference on the Simulation and Synthesis of Living Systems {(ALife} {IX)} %C Boston, MA %P 160–173 %G eng %U http://arxiv.org/abs/nlin.AO/0408006 %0 Conference Paper %B Artificial Life {IX} Proceedings of the Ninth International Conference on the Simulation and Synthesis of Living Systems %D 2004 %T Updating Schemes in Random {Boolean} Networks: Do They Really Matter? %A Carlos Gershenson %E J. Pollack %E M. Bedau %E P. Husbands %E T. Ikegami %E R. A. Watson %X 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. %B Artificial Life {IX} Proceedings of the Ninth International Conference on the Simulation and Synthesis of Living Systems %I MIT Press %P 238–243 %G eng %U http://arxiv.org/abs/nlin.AO/0402006 %0 Conference Paper %B Advances in Artificial Life, 7th European Conference, {ECAL} 2003 {LNAI} 2801 %D 2003 %T Contextual Random {Boolean} Networks %A Carlos Gershenson %A Jan Broekaert %A Diederik Aerts %E Banzhaf, W %E T. Christaller %E P. Dittrich %E J. T. Kim %E J. Ziegler %X We propose the use of Deterministic Generalized Asynchronous Random Boolean Networks (Gershenson, 2002) as models of contextual deterministic discrete dynamical systems. We show that changes in the context have drastic effects on the global properties of the same networks, namely the average number of attractors and the average percentage of states in attractors. We introduce the situation where we lack knowledge on the context as a more realistic model for contextual dynamical systems. We notice that this makes the network non-deterministic in a specific way, namely introducing a non-Kolmogorovian quantum-like structure for the modelling of the network (Aerts 1986). In this case, for example, a state of the network has the potentiality (probability) of collapsing into different attractors, depending on the specific form of lack of knowledge on the context. %B Advances in Artificial Life, 7th European Conference, {ECAL} 2003 {LNAI} 2801 %I Springer-Verlag %P 615–624 %G eng %U http://uk.arxiv.org/abs/nlin.AO/0303021 %0 Conference Paper %B Advances in Artificial Life, 7th European Conference, {ECAL} 2003 {LNAI} 2801 %D 2003 %T When Can We Call a System Self-Organizing? %A Carlos Gershenson %A Francis Heylighen %E Banzhaf, W %E T. Christaller %E P. Dittrich %E J. T. Kim %E J. Ziegler %X We do not attempt to provide yet another definition of self-organizing systems, nor review previous definitions. We explore the conditions necessary to describe self-organizing systems, inspired on decades of their study, in order to understand them better. These involve the dynamics of the system, and the purpose, boundaries, and description level chosen by an observer. We show how, changing the level or ``graining'' of description, the same system can be self-organizing or not. We also discuss common problems we face when studying self-organizing systems. We analyse when building, designing, and controlling artificial self-organizing systems is useful. We state that self-organization is a way of observing systems, not a class of systems. %B Advances in Artificial Life, 7th European Conference, {ECAL} 2003 {LNAI} 2801 %I Springer %C Berlin %P 606–614 %G eng %U http://arxiv.org/abs/nlin.AO/0303020 %0 Conference Paper %B Proceedings of the 2nd Workshop on Epigenetic Robotics %D 2002 %T Behaviour-Based Knowledge Systems: An Epigenetic Path from Behaviour to Knowledge %A Carlos Gershenson %E Christopher G. Prince %E Yiannis Demiris %E Yuval Marom %E Hideki Kozima %E Christian Balkenius %X In this paper we expose the theoretical background underlying our current research. This consists in the development of behaviour-based knowledge systems, for closing the gaps between behaviour-based and knowledge-based systems, and also between the understandings of the phenomena they model. We expose the requirements and stages for developing behaviour-based knowledge systems and discuss their limits. We believe that these are necessary conditions for the development of higher order cognitive capacities, in artificial and natural cognitive systems. %B Proceedings of the 2nd Workshop on Epigenetic Robotics %I Lund University Cognitive Studies %C Edinburgh, Scotland %V 94 %P 35–41 %G eng %U http://www.lucs.lu.se/ftp/pub/LUCS%5FStudies/LUCS94/Gershenson.pdf %0 Conference Paper %B Artificial Life {VIII}: Proceedings of the Eight International Conference on Artificial Life %D 2002 %T Classification of Random {Boolean} Networks %A Carlos Gershenson %E Standish, R. K. %E M. A. Bedau %E H. A. Abbass %X We provide the first classification of different types of Random Boolean Networks (RBNs). We study the differences of RBNs depending on the degree of synchronicity and determinism of their updating scheme. For doing so, we first define three new types of RBNs. We note some similarities and differences between different types of RBNs with the aid of a public software laboratory we developed. Particularly, we find that the point attractors are independent of the updating scheme, and that RBNs are more different depending on their determinism or non-determinism rather than depending on their synchronicity or asynchronicity. We also show a way of mapping non-synchronous deterministic RBNs into synchronous RBNs. Our results are important for justifying the use of specific types of RBNs for modelling natural phenomena. %B Artificial Life {VIII}: Proceedings of the Eight International Conference on Artificial Life %I MIT Press %C Cambridge, MA, USA %P 1–8 %G eng %U http://arxiv.org/abs/cs/0208001 %0 Conference Paper %B {MICAI} 2000: Advances in Artificial Intelligence %D 2000 %T A Model for Combination of External and Internal Stimuli in the Action Selection of an Autonomous Agent %A P. P. González %A J. Negrete %A A. Barreiro %A C. Gershenson. %E {O. Cairó %E L. E. Súcar, F.J. Cantú %X This paper proposes a model for combination of external and internal stimuli for the action selection in an autonomous agent, based in an action selection mechanism previously proposed by the authors. This combination model includes additive and multiplicative elements, which allows to incorporate new properties, which enhance the action selection. A given parameter a, which is part of the proposed model, allows to regulate the degree of dependence of the observed external behaviour from the internal states of the entity. %B {MICAI} 2000: Advances in Artificial Intelligence %S Lecture Notes in Artificial Intelligence %I Springer, Verlag %C Acapulco, México %V 1793 %P 621–633 %G eng %U http://uk.arxiv.org/abs/cs.AI/0211040 %0 Conference Paper %B {SAB} 2000 Proceedings Supplement %D 2000 %T Thinking Adaptive: Towards a Behaviours Virtual Laboratory %A C. Gershenson %A P. P. González %A J. Negrete %E Jean-Arcady Meyer %E Alain Berthoz %E Dario Floreano %E Herbert L. Roitblat %E Stewart W. Wilson %X In this paper we name some of the advantages of virtual laboratories; and propose that a Behaviours Virtual Laboratory should be useful for both biologists and AI researchers, offering a new perspective for understanding adaptive behaviour. We present our development of a Behaviours Virtual Laboratory, which at this stage is focused in action selection, and show some experiments to illustrate the properties of our proposal, which can be accessed via Internet. %B {SAB} 2000 Proceedings Supplement %I ISAB press %C Paris, France %G eng %U http://uk.arxiv.org/abs/cs/0211028