相关论文: Majority-Vote Cellular Automata, Ising Dynamics, a…
The cellular automata discrete dynamical system is considered as the two-stage process: the majority rule for the change in the automata state and the rule for the change in topological relations between automata. The influence of changing…
Universality classes of Ising-like phase transitions are investigated in series of two-dimensional synchronously updated probabilistic cellular automata (PCAs), whose time evolution rules are either of Glauber type or of majority-vote type,…
We consider the problem of metastability in a probabilistic cellular automaton (PCA) with a parallel updating rule which is reversible with respect to a Gibbs measure. The dynamical rules contain two parameters $\beta$ and $h$ which…
Cellular automata are a set of computational models in discrete space that have a discrete time evolution defined by neighbourhood rules. They are used to simulate many complex systems in physics and science in general. In this work,…
A minimalistic model for chimera states is presented. The model is a cellular automaton (CA) which depends on only one adjustable parameter, the range of the nonlocal coupling, and is built from elementary cellular automata and the majority…
Voting is an important social activity for expressing public opinions. By conceptually considering a group of voting agents to be intelligent matter, the impact of real-time information on voting results is quantitatively studied by an…
Thermal noise in a cellular automaton refers to a random perturbation to its function which eventually leads this automaton to an equilibrium state controlled by a temperature parameter. We study the 1-dimensional majority-3 cellular…
Probabilistic cellular automata describe the dynamics of classical spin models, which, for sufficiently small temperature $T$, can serve as classical memory capable of storing information even in the presence of nonzero external magnetic…
In this article we investigate the computational complexity of predicting two dimensional freezing majority cellular automata with states $\{-1,+1\}$, where the local interactions are based on an L-shaped neighborhood structure. In these…
Consider a graph $G=(V,E)$ and a random initial vertex-coloring, where each vertex is blue independently with probability $p_{b}$, and red with probability $p_r=1-p_b$. In each step, all vertices change their current color synchronously to…
We study numerically the ordering process of two very simple dynamical models for a two-state variable on several topologies with increasing levels of heterogeneity in the degree distribution. We find that the zero-temperature Glauber…
We investigate Boolean, totalistic cellular automata with a majority or frustrated majority vote rule, and an interaction range of variable span. These two models show a behavior which differs from the mean-field one. The majority vote…
We introduce a simple model of opinion dynamics in which binary-state agents evolve due to the influence of agents in a local neighborhood. In a single update step, a fixed-size group is defined and all agents in the group adopt the state…
Cellular automata (CA) consist of an array of identical cells, each of which may take one of a finite number of possible states. The entire array evolves in discrete time steps by iterating a global evolution G. Further, this global…
We discuss the process of opinion formation in a completely homogeneous, democratic population using a class of probabilistic cellular automata models with two absorbing states. Each individual can have one of two opinions that can change…
Cellular automata are synchronous discrete dynamical systems used to describe complex dynamic behaviors. The dynamic is based on local interactions between the components, these are defined by a finite graph with an initial node coloring…
Finding a ground state of a given Hamiltonian of an Ising model on a graph $G=(V,E)$ is an important but hard problem. The standard approach for this kind of problem is the application of algorithms that rely on single-spin-flip Markov…
We consider the problem of predicting the spin states in a kinetic Ising model when spin trajectories are observed for only a finite fraction of sites. In a Bayesian setting, where the probabilistic model of the spin dynamics is assumed to…
Simulations are reported on the Ising two-dimensional ferromagnet in the presence of a special kind of noise. The noise spectrum P(n) follows a power law, where P(n) is the probability of flipping randomly selected n spins at each timestep.…
A probabilistic cellular automaton (PCA) can be viewed as a Markov chain. The cells are updated synchronously and independently, according to a distribution depending on a finite neighborhood. We investigate the ergodicity of this Markov…