元胞自动机与格子气

We show that there exists a one-to-one correspondence between the set of number-conserving cellular automata (CA) with $q$ inputs and the set of balanced sequences with $q$ terms. This allows to enumerate number-conserving CA. We also show…

We discuss example of an elementary cellular automaton for which the density of ones decays toward its limiting value as a power of the number of iterations $n$. Using the fact that this rule conserves the number of blocks 10 and that…

In this paper, I propose a realistic interpretation (RI) of quantum mechanics, that is, an interpretation according to which a particle follows a definite path in spacetime. The path is not deterministic but it is rather a random walk.…

We address the problem of reconstructing a multi-band signal from its sub-Nyquist point-wise samples. To date, all reconstruction methods proposed for this class of signals assumed knowledge of the band locations. In this paper, we develop…

Both cellular automata (CA) and lattice-gas automata (LG) provide finite algorithmic presentations for certain classes of infinite dynamical systems studied by symbolic dynamics; it is customary to use the term `cellular automaton' or…

Individual cellular automata rules are attractive models for a range of biological and physical self-assembling systems. While coexpression and coevolution are common in such systems, ensembles of cellular automata rules remain poorly…

The success of an infectious disease to invade a population is strongly controlled by the population's specific connectivity structure. Here a network model is presented as an aid in understanding the role of social behavior and…

We present a systematic study of capillary filling for multi-phase flows by using mesoscopic lattice Boltzmann models describing a diffusive interface moving at a given contact angle with respect to the walls. We compare the numerical…

In this paper we study the dynamics of 1- and 2- dimensional cellular automata, using a 2-adic representation of the states, we give a simple graphical technique for finding periodic solutions. We also study the continuity properties of the…

In this paper we explore a possibility that all transport turbulent models are contained in a coarse-grained kinetic equation. Building on a recent work by H.Chen et al (2004), we account for fluctuations of a single -point probability…

We performed a numerical study on random Boolean networks with power-law rank outdegree distributions to find local structural cause for the emergence of high or low degree of coherence in binary state variables. The degree of randomness…

Rule 110 is a complex elementary cellular automaton able of supporting universal computation and complicated collision-based reactions between gliders. We propose a representation for coding initial conditions by means of a finite subset of…

An approach based on a lattice version of the Boltzmann kinetic equation for describing multi-phase flows in nano- and micro-corrugated devices is proposed. We specialize it to describe the wetting/dewetting transition of fluids in presence…

In this paper we study the problem of the existence of a least-action principle for invertible, second-order dynamical systems, discrete in time and space. We show that, when the configuration space is finite, a least-action principle does…

The critical points of the 3-states two-layer Potts model on square lattice for different interlayer couplings (Kx, Ky,and Kz) are calculated with high precision using probabilistic cellular automata with Glauber algorithm, where Kx and Ky…

The advantage of Cellular Potts Model (CPM) is due to its ability for introducing cell-cell interaction based on the well known statistical model i.e. the Potts model. On the other hand, Lattice gas Cellular Automata (LGCA) can simulate…

We investigate dynamics of the cellular automaton rule 142. This rule possesses additive invariant of the second order, namely it conserves the number of blocks 10. Rule 142 can be alternatively described as an operation on a binary string…

We say that a Cellular Automata (CA) is coalescing when its execution on two distinct (random) initial configurations in the same asynchronous mode (the same cells are updated in each configuration at each time step) makes both…

The classical dynamical systems model of continuous stirred tank reactors (CSTR) in which a first order chemical reaction takes place is reformulated in terms of stochastic cellular automata by extending previous works of Seyborg (1997) and…

For a large class of inhomogeneous interacting particle systems (IPS) on a lattice we develop a rigorous method for mapping them onto homogeneous IPS. Our novel approach provides a direct way of obtaining the statistical properties of such…