Related papers: A cellular automaton identification of the univers…
Studies of the phase diagram of the coupled sine circle map lattice have identified the presence of two distinct universality classes of spatiotemporal intermittency viz. spatiotemporal intermittency of the directed percolation class with a…
The phase diagram of the coupled sine circle map lattice exhibits a variety of interesting phenomena including spreading regions with spatiotemporal intermittency, non-spreading regions with spatial intermittency, and coherent structures…
We present strong evidence that a coupled-map-lattice model for spatio-temporal intermittency belongs to the universality class of directed percolation when the updating rules are asynchronous, i.e. when only one randomly chosen site is…
There are few known universality classes of absorbing phase transitions in one dimension and most models fall in the well-known directed percolation (DP) class. Synchronization is a transition to an absorbing state and this transition is…
A general mathematical method is presented for the systematic construction of coupled map lattices (CMLs) out of deterministic cellular automata (CAs). The entire CA rule space is addressed by means of a universal map for CAs that we have…
We study the existence of chimera states, i.e. mixed states, in a globally coupled sine circle map lattice, with different strengths of inter-group and intra-group coupling. We find that at specific values of the parameters of the CML, a…
We study spatiotemporal intermittency in a system of coupled sine circle maps. The phase diagram of the system shows parameter regimes where the STI lies in the directed percolation class, as well as regimes which show pure spatial…
We say that a Cellular Automata (CA) is coalescing when its execution on two distinct (random) initial configurations in the same asynchronous mode (the same cells are updated in each configuration at each time step) makes both…
We study the phase diagram of the sine circle map lattice with random initial conditions and identify the various types of dynamical behaviour which appear here. We focus on the regions which show spatio-temporal intermittency and…
We say that a Cellular Automata (CA) is coalescing when its execution on two distinct (random) initial configurations in the same asynchronous mode (the same cells are updated in each configuration at each time step) makes both…
We consider a lattice of coupled circle maps, a model arising naturally in descriptions of solid state phenomena such as Josephson junction arrays. We find that the onset of spatiotemporal intermittency (STI) in this system is analogous to…
One-dimensional cellular automata are discrete dynamical systems that operate on an infinite lattice of sites and are characterized by the locality and uniformity of their update rule. Permutations of the state set and isometric…
We investigate the critical behaviour of a probabilistic mixture of cellular automata (CA) rules 182 and 200 (in Wolfram's enumeration scheme) by mean-field analysis and Monte Carlo simulations. We found that as we switch off one CA and…
Cellular Automata are discrete--time dynamical systems on a spatially extended discrete space which provide paradigmatic examples of nonlinear phenomena. Their stochastic generalizations, i.e., Probabilistic Cellular Automata, are discrete…
A digit function is presented which provides the $i$th-digit in base $p$ of any real number $x$. By means of this function, formulated within $\mathcal{B}$-calculus, the local, nonlocal and global dynamical behaviors of cellular automata…
We argue that the synchronization transition of stochastically coupled cellular automata, discovered recently by L.G. Morelli {\it et al.} (Phys. Rev. {\bf 58 E}, R8 (1998)), is generically in the directed percolation universality class. In…
We study spatio-temporal intermittency (STI) in a system of coupled sine circle maps. The phase diagram of the system shows parameter regimes with STI of both the directed percolation (DP) and non-DP class. STI with synchronized laminar…
We describe a class of cellular automata (CAs) that are end-to-end differentiable. DCAs interpolate the behavior of ordinary CAs through rules that act on distributions of states. The gradient of a DCA with respect to its parameters can be…
Cellular automata (CA) are a class of computational models that exhibit rich dynamics emerging from the local interaction of cells arranged in a regular lattice. In this work we focus on a generalised version of typical CA, called graph…
A synchronization mechanism driven by annealed noise is studied for two replicas of a coupled-map lattice which exhibits stable chaos (SC), i.e. irregular behavior despite a negative Lyapunov spectrum. We show that the observed…