1,044 research outputs found
Robustness of Cellular Automata in the Light of Asynchronous Information Transmission
International audienceCellular automata are classically synchronous: all cells are simultaneously updated. However, it has been proved that perturbations in the updating scheme may induce qualitative changes of behaviours. This paper presents a new type of asynchronism, the beta -synchronism, where cells still update at each time step but where the transmission of information between cells is disrupted randomly. We experimentally study the behaviour of beta-synchronous models. We observe that, although many eff ects are similar to the perturbation of the update, novel phenomena occur. We particularly study phase transitions as an illustration of a qualitative variation of behaviour triggered by continuous change of the disruption probability beta
A guided tour of asynchronous cellular automata
Research on asynchronous cellular automata has received a great amount of
attention these last years and has turned to a thriving field. We survey the
recent research that has been carried out on this topic and present a wide
state of the art where computing and modelling issues are both represented.Comment: To appear in the Journal of Cellular Automat
A Max-Plus Model of Asynchronous Cellular Automata
This paper presents a new framework for asynchrony. This has its origins in
our attempts to better harness the internal decision making process of cellular
automata (CA). Thus, we show that a max-plus algebraic model of asynchrony
arises naturally from the CA requirement that a cell receives the state of each
neighbour before updating. The significant result is the existence of a
bijective mapping between the asynchronous system and the synchronous system
classically used to update cellular automata. Consequently, although the CA
outputs look qualitatively different, when surveyed on "contours" of real time,
the asynchronous CA replicates the synchronous CA. Moreover, this type of
asynchrony is simple - it is characterised by the underlying network structure
of the cells, and long-term behaviour is deterministic and periodic due to the
linearity of max-plus algebra. The findings lead us to proffer max-plus algebra
as: (i) a more accurate and efficient underlying timing mechanism for models of
patterns seen in nature, and (ii) a foundation for promising extensions and
applications.Comment: in Complex Systems (Complex Systems Publications Inc), Volume 23,
Issue 4, 201
Rule switching mechanisms in the Game of Life with synchronous and asynchronous updating policy
The emergence of complex structures in the systems governed by a simple set
of rules is among the most fascinating aspects of Nature. The particularly
powerful and versatile model suitable for investigating this phenomenon is
provided by cellular automata, with the Game of Life being one of the most
prominent examples. However, this simplified model can be too limiting in
providing a tool for modelling real systems. To address this, we introduce and
study an extended version of the Game of Life, with the dynamical process
governing the rule selection at each step. We show that the introduced
modification significantly alters the behaviour of the game. We also
demonstrate that the choice of the synchronization policy can be used to
control the trade-off between the stability and the growth in the system.Comment: 14 pages, 5+1 figures, code available at
https://doi.org/10.5281/zenodo.809960
Spatial competitive games with disingenuously delayed positions
Citation: Soltanolkottabi, M., Ben-Arieh, D., & Wu, C.H. (2017). Spatial competitive games with disingenuously delayed positions. Manuscript, Kansas State University, Manhattan, KS.During the last decade, spatial games have received great attention from researchers showing the behavior of populations of players over time in a spatial structure. One of the main factors which can greatly affect the destiny of such populations is the updating scheme used to apprise new strategies of players. Synchronous updating is the most common updating strategy in which all players update their strategy at the same time. In order to be able to describe the behavior of populations more realistically several asynchronous updating schemes have been proposed. Asynchronous game does not use a universal and players can update their strategy at different time steps during the play. In this paper, we introduce a new type of asynchronous strategy updating in which some of the players hide their updated strategy from their neighbors for several time steps. It is shown that this behavior can change the behavior of populations but does not necessarily lead to a higher payoff for the dishonest players. The paper also shows that with dishonest players, the average payoff of players is less than what they think they get, while they are not aware of their neighbors’ true strategy
Probing robustness of cellular automata through variations of asynchronous updating
International audienceTypically viewed as a deterministic model of spatial computing, cellular automata are here considered as a collective system subject to the noise inherent to natural computing. The classical updating scheme is replaced by stochastic versions which either randomly update cells or disrupt the cell-to-cell transmission of information. We then use the novel updating schemes to probe the behaviour of Elementary Cellular Automata, and observe a wide variety of results. We study these behaviours in the scope of macroscopic statistical phenomena and microscopic analysis. Finally, we discuss the possibility to use updating schemes to probe the robustness of complex systems
Agent-Based Modeling: The Right Mathematics for the Social Sciences?
This study provides a basic introduction to agent-based modeling (ABM) as a powerful blend of classical and constructive mathematics, with a primary focus on its applicability for social science research.� The typical goals of ABM social science researchers are discussed along with the culture-dish nature of their computer experiments. The applicability of ABM for science more generally is also considered, with special attention to physics. Finally, two distinct types of ABM applications are summarized in order to illustrate concretely the duality of ABM: Real-world systems can not only be simulated with verisimilitude using ABM; they can also be efficiently and robustly designed and constructed on the basis of ABM principles. �
- …