Searcharxiv⌕ Search

arXiv subjects

Nazim Fatès

Publications and source records attributed to Nazim Fatès.

5 recordsLinked to original sources

Analysis of the asymptotic density of endogamous diploid cellular automata

We investigate the asymptotic behaviour of diploid Elementary Cellular Automata (ECA), that is, the stochastic mixtures between two ECAs. In this model, each cell independently applies one rule with probability $λ$ and the other rule with probability $ 1 - λ$. Focusing on the endogamous diploids where the two ECAs are related by the reflection or conjugation symmetry, we analyse how the density varies as function of $λ$, the ``degree of mixing'' of these two rules. We propose a classification into six distinct classes depending on the profile of the density vs. $λ$ curve. We take various examples for each class and we analyse to which extent the local structure approximation succeeds to predict the asymptotic density. Our results show that for rules in which the asymptotic density depends linearly on $λ$, the local structure approximation reproduces the exact dependence of the density on $λ$. For rules with differentiable but nonlinear dependence, the approximation either becomes exact at a finite order or converges rapidly to the exact solution as the order increases. For rules with first-order phase transitions, finite-order approximations progressively approach a sharp transition profile with increasing order. In contrast, for rules exhibiting a second-order phase transition, even high-order approximations fail to capture the qualitative features of the transition. (no bifurcation is observed). Finally, we give examples of two diploid rules for which we succeed to compute the density at each time step.

nlin.CG↗

Self-stabilisation of cellular automata on tilings

Given a finite set of local constraints, we seek a cellular automaton (i.e., a local and uniform algorithm) that self-stabilises on the configurations that satisfy these constraints. More precisely, starting from a finite perturbation of a valid configuration, the cellular automaton must eventually fall back into the space of valid configurations where it remains still. We allow the cellular automaton to use extra symbols, but in that case, the extra symbols can also appear in the initial finite perturbation. For several classes of local constraints (e.g., $k$-colourings with $k\neq 3$, and North-East deterministic constraints), we provide efficient self-stabilising cellular automata with or without additional symbols that wash out finite perturbations in linear or quadratic time, but also show that there are examples of local constraints for which the self-stabilisation problem is inherently hard. We note that the optimal self-stabilisation speed is the same for all local constraints that are isomorphic to one another. We also consider probabilistic cellular automata rules and show that in some cases, the use of randomness simplifies the problem. In the deterministic case, we show that if finite perturbations are corrected in linear time, then the cellular automaton self-stabilises even starting from a random perturbation of a valid configuration, that is, when errors in the initial configuration occur independently with a sufficiently low density.

nlin.CG↗

Two-dimensional traffic rules and the density classification problem

The density classification problem is the computational problem of finding the majority in a given array of votes in a distributed fashion. It is known that no cellular automaton rule with binary alphabet can solve the density classification problem. On the other hand, it was shown that a probabilistic mixture of the traffic rule and the majority rule solves the one-dimensional problem correctly with a probability arbitrarily close to one. We investigate the possibility of a similar approach in two dimensions. We show that in two dimensions, the particle spacing problem, which is solved in one dimension by the traffic rule, has no cellular automaton solution. However, we propose exact and randomized solutions via interacting particle systems. We assess the performance of our models using numeric simulations.

nlin.CG↗

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.

nlin.CG↗