Philippe Chassaing ; Lucas Gerin
-
Asynchronous Cellular Automata and Brownian Motion
dmtcs:3527 -
Discrete Mathematics & Theoretical Computer Science,
January 1, 2007,
DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07)
-
https://doi.org/10.46298/dmtcs.3527
Asynchronous Cellular Automata and Brownian MotionArticle
Authors: Philippe Chassaing 1; Lucas Gerin 1
NULL##NULL
Philippe Chassaing;Lucas Gerin
1 Institut Élie Cartan de Nancy
This paper deals with some very simple interacting particle systems, \emphelementary cellular automata, in the fully asynchronous dynamics: at each time step, a cell is randomly picked, and updated. When the initial configuration is simple, we describe the asymptotic behavior of the random walks performed by the borders of the black/white regions. Following a classification introduced by Fatès \emphet al., we show that four kinds of asymptotic behavior arise, two of them being related to Brownian motion.
Roberto Fernández;Pierre-Yves Louis;Francesca R. Nardi, Emergence, complexity and computation, Overview: PCA Models and Issues, pp. 1-30, 2018, 10.1007/978-3-319-65558-1_1.
Andrzej Golabczak;Andrzej Konstantynowicz;Marcin Golabczak, Advanced structured materials, Mathematical Modelling of the Physical Phenomena in the Interelectrode Gap of the EDM Process by Means of Cellular Automata and Field Distribution Equations, pp. 169-184, 2013, 10.1007/978-3-319-00506-5_11.
Damien Regnault, Lecture notes in computer science, Proof of a Phase Transition in Probabilistic Cellular Automata, pp. 433-444, 2013, 10.1007/978-3-642-38771-5_38.