scholarly journals Asynchronous Cellular Automata and Brownian Motion

2007 ◽  
Vol DMTCS Proceedings vol. AH,... (Proceedings) ◽  
Author(s):  
Philippe Chassaing ◽  
Lucas Gerin

International audience 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.

2021 ◽  
Vol 183 (3) ◽  
Author(s):  
Mario Ayala ◽  
Gioia Carinci ◽  
Frank Redig

AbstractWe study the symmetric inclusion process (SIP) in the condensation regime. We obtain an explicit scaling for the variance of the density field in this regime, when initially started from a homogeneous product measure. This provides relevant new information on the coarsening dynamics of condensing interacting particle systems on the infinite lattice. We obtain our result by proving convergence to sticky Brownian motion for the difference of positions of two SIP particles in the sense of Mosco convergence of Dirichlet forms. Our approach implies the convergence of the probabilities of two SIP particles to be together at time t. This, combined with self-duality, allows us to obtain the explicit scaling for the variance of the fluctuation field.


The sixth chapter deals with the construction of pseudo-random number generators based on a combination of two cellular automata, which were considered in the previous chapters. The generator is constructed based on two cellular automata. The first cellular automaton controls the location of the active cell on the second cellular automaton, which realizes the local state function for each cell. The active cell on the second cellular automaton is the main cell and from its output bits of the bit sequence are formed at the output of the generator. As the first cellular automaton, an asynchronous cellular automaton is used in this chapter, and a synchronous cellular automaton is used as the second cellular automaton. In this case, the active cell of the second cellular automaton realizes another local function at each time step and is inhomogeneous. The algorithm for the work of a cell of a combined cellular automaton for implementing a generator and its hardware implementation are presented.


1996 ◽  
Vol 07 (01) ◽  
pp. 1-18 ◽  
Author(s):  
HANS DE JONG ◽  
CHRISTIAN MAES

We discuss computational aspects of verifying constructive criteria for ergodicity of interacting particle systems. Both discrete time (probabilistic cellular automata) and continuous time spin flip dynamics are considered. We also investigate how the criteria have to be adapted if stirring is added to the dynamics.


2006 ◽  
Vol 238 (2) ◽  
pp. 375-404 ◽  
Author(s):  
Yuri G. Kondratiev ◽  
Tobias Kuna ◽  
Maria João Oliveira

Sign in / Sign up

Export Citation Format

Share Document