Asynchronous Cellular Automata and Brownian Motion
نویسندگان
چکیده
This paper deals with some very simple interacting particle systems, elementary cellular automata, in the fully asyn-chronous 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 et al., we show that four kinds of asymptotic behavior arise, two of them being related to Brownian motion.
منابع مشابه
Efficient Computation in Brownian Cellular Automata
A Brownian cellular automaton is a kind of asynchronous cellular automaton, in which certain local configurations—like signals— propagate randomly in the cellular space, resembling Brownian motion. The Brownian-like behavior is driven by three kinds of local transition rules, two of which are locally reversible and rotation symmetric, thus mapping a rule’s left-hand side into a right-hand side ...
متن کاملFluctuation-driven computing on number-conserving cellular automata
A number-conserving cellular automaton (NCCA) is a cellular automaton where the states of cells are denoted by integers, and the sum of all numbers in a configuration is conserved throughout its evolution. It has been widely used to model physical systems ruled by conservation law of mass or energy. Imai et al. (2002) showed that an NCCA’s local transition function can be effectively translated...
متن کاملImproved Frog Leaping Algorithm Using Cellular Learning Automata
In this paper, a new algorithm which is the result of the combination of cellular learning automata and frog leap algorithm (SFLA) is proposed for optimization in continuous, static environments.At the proposed algorithm, each memeplex of frogs is placed in a cell of cellular learning automata. Learning automata in each cell acts as the brain of memeplex, and will determine the strategy of moti...
متن کاملEntry times in automata with simple defect dynamics
In this paper, we consider a simple cellular automaton with two particles of different speeds that annihilate on contact. Following a previous work by Kůrka et al., we study the asymptotic distribution, starting from a random configuration, of the waiting time before a particle crosses the central column after time n. Drawing a parallel between the behaviour of this automata on a random initial...
متن کاملOn a Universal Brownian Cellular Automata with 3 States and 2 Rules
This paper presents a 3-state asynchronous CA that requires merely two transition rules to achieve computational universality. This universality is achieved by embedding Priese’s delay-insensitive circuit elements, called the E-element and the K-element, on the cell space of a so-called Brownian CA, which is an asynchronous CA containing local configurations that conduct a random walk in the ci...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008