Related papers: Synchronous and Asynchronous Updates of Active Isi…
In this study the effect of parallel and random-sequential updates on the dynamical properties of flocks in one dimension is considered. It is found that the frequency of directional switching is increased for random-sequential updates as…
We update a one-dimensional chain of Ising spins of length $L$ with algorithms which are parameterized by the probability $p$ for a certain site to get updated in one time step. The result of the update event itself is determined by the…
A one-dimensional flocking model using active Ising spins is studied, where the system evolves through the reinforcement learning approach \textit{via} defining state, action, and cost function for each spin. The orientation of spin with…
When we focus on finite dynamical systems from both the computability/complexity and the modelling standpoints, automata networks seem to be a particularly appropriate mathematical model on which theory shall be developed. In this paper,…
In parallel and distributed environments, generational evolutionary algorithms often do not exploit the full potential of the computation system since they have to wait until the entire population is evaluated before starting selection…
In this paper we study updating effects on cellular automata rule space. We consider a subset of 6144 order-3 automata from the space of 262144 bi-dimensional outer-totalistic rules. We compare synchronous to asynchronous and sequential…
The three-state Ising neural network with synchronous updating and variable dilution is discussed starting from the appropriate Hamiltonians. The thermodynamic and retrieval properties are examined using replica mean-field theory.…
Extensive Monte Carlo simulations are performed on a two-dimensional random field Ising model. The purpose of the present work is to study the disorder-induced changes in the properties of disordered spin systems. The time evolution of the…
We compare asynchronous vs. synchronous update of discrete dynamical networks and find that a simple time delay in the nodes may induce a reproducible deterministic dynamics even in the case of asynchronous update in random order. In…
We investigate a kinetic Ising model with several single-spin flip dynamics (including Metropolis and heat-bath) on quenched and annealed random regular graphs. As expected, on the quenched structures all proposed algorithms reproduce the…
We study the metastable behavior of the two-dimensional Ising model in the case of an alternate updating rule: parallel updating of spins on the even (odd) sublattice are permitted at even (odd) times. We show that although the dynamics is…
Kinetic Ising models on the square lattice with both nearest-neighbor interactions and self-interaction are studied for the cases of random sequential updating and parallel updating. The equilibrium phase diagrams and critical dynamics are…
We investigate the spatiotemporal dynamics of coupled circle map lattices, evolving under synchronous (parallel) updating on one hand and asynchronous (random) updating rules on the other. Synchronous evolution of extended spatiotemporal…
In this paper, we study the effect of (a)synchronism on the dynamics of elementary cellular automata. Within the framework of our study, we choose five distinct update schemes, selected from the family of periodic update modes: parallel,…
Animal groups frequently move in a highly organized manner, as represented by flocks of birds and schools of fish. Despite being an everyday occurrence, we do not yet fully understand how this works. What type of social interactions between…
We present exact results, as well as some illustrative Monte Carlo simulations, concerning a stochastic network with weighted connections in which the fraction of nodes that are dynamically synchronized is a parameter. This allows one to…
The dynamics of a one dimensional Ising spin system is investigated using three families of local update rules, the Galam majority rules, Glauber inflow influences and Sznadj outflow drives. Given an initial density p of up spins the…
In this paper we study the phase transitions of different types of Random Boolean networks. These differ in their updating scheme: synchronous, semi-synchronous, or asynchronous, and deterministic or non-deterministic. It has been shown…
The Rugged Metropolis (RM) algorithm is a biased updating scheme, which aims at directly hitting the most likely configurations in a rugged free energy landscape. Details of the one-variable (RM$_1$) implementation of this algorithm are…
In automata networks, it is well known that the way entities update their states over time has a major impact on their dynamics. In particular, depending on the chosen update schedule, the underlying dynamical systems may exhibit more or…