Local structure approximation as a predictor of second-order phase transitions in asynchronous cellular automata

AbstractThe mathematical analysis of the second-order phase transitions that occur in α-asynchronous cellular automata field is a highly challenging task. From the experimental side, these phenomena appear as a qualitative change of behaviour which separates a behaviour with an active phase, where the system evolves in a stationary state with fluctuations, from a passive state, where the system is absorbed in a homogeneous fixed state. The transition between the two phases is abrupt: we ask how to analyse this change and how to predict the critical value of the synchrony rate α. We show that an extension of the mean-field approximation, called the local structure theory, can be used to predict the existence of second-order phase transitions belonging to the directed percolation university class. The change of behaviour is related to the existence of a transcritical bifurcation in the local structure maps. We show that for a proper setting of the approximation, the form of the transition is predicted correctly and, more importantly, an increase in the level of local structure approximation allows one to gain precision on the value of the critical synchrony rate which separates the two phases.

[1]  Nazim Fatès,et al.  Fully asynchronous behavior of double-quiescent elementary cellular automata , 2006, Theor. Comput. Sci..

[2]  Mark Fannes,et al.  On solvable models in classical lattice systems , 1984 .

[3]  Jonathan D. Victor,et al.  Local structure theory for cellular automata , 1987 .

[4]  Damien Regnault Proof of a Phase Transition in Probabilistic Cellular Automata , 2013, Developments in Language Theory.

[5]  H. J. Brascamp Equilibrium states for a one dimensional lattice gas , 1971 .

[6]  J. Ricardo G. Mendoncca,et al.  An extinction-survival-type phase transition in the probabilistic cellular automaton p182?q200 , 2011 .

[7]  Giancarlo Mauri,et al.  m-Asynchronous cellular automata: from fairness to quasi-fairness , 2013, Natural Computing.

[8]  Nazim Fatès,et al.  An Experimental Study of Robustness to Asynchronism for Elementary Cellular Automata , 2004, Complex Syst..

[9]  Nazim Fatès,et al.  A Guided Tour of Asynchronous Cellular Automata , 2013, J. Cell. Autom..

[10]  Rodney A. Brooks,et al.  Asynchrony induces stability in cellular automata based models , 1994 .

[11]  J. Yorke,et al.  Chaos: An Introduction to Dynamical Systems , 1997 .

[12]  Jean Mairesse,et al.  Around probabilistic cellular automata , 2014, Theor. Comput. Sci..

[13]  L. Taggi Critical Probabilities and Convergence Time of Percolation Probabilistic Cellular Automata , 2013, 1312.6990.

[14]  Luís Correia,et al.  Effects of asynchronism on evolutionary games. , 2011, Journal of theoretical biology.

[15]  Nazim Fatès,et al.  Asynchronism Induces Second-Order Phase Transitions in Elementary Cellular Automata , 2007, J. Cell. Autom..

[16]  Jonathan D. Victor,et al.  Local Structure Theory in More Than One Dimension , 1987, Complex Syst..

[17]  T. E. Ingerson,et al.  Structure in asynchronous cellular automata , 1984 .

[18]  Henryk Fuks,et al.  Construction of Local Structure Maps for Cellular Automata , 2013, J. Cell. Autom..