相关论文: Algorithmic Mapping Criticality into Self Organize…
We propose a novel density based numerical method for uncertainty propagation under certain partial differential equation dynamics. The main idea is to translate them into objects that we call cellular probabilistic automata and to evolve…
A digit function is presented which provides the $i$th-digit in base $p$ of any real number $x$. By means of this function, formulated within $\mathcal{B}$-calculus, the local, nonlocal and global dynamical behaviors of cellular automata…
The paper continues the authors' study of the linearizability problem for nonlinear control systems. In the recent work [K. Sklyar, Systems Control Lett. 134 (2019), 104572], conditions on mappability of a nonlinear control system to a…
The concept of percolation is combined with a self-consistent treatment of the interaction between the dynamics on a lattice and the external drive. Such a treatment can provide a mechanism by which the system evolves to criticality without…
The complexity of cellular automata is traditionally measured by their computational capacity. However, it is difficult to choose a challenging set of computational tasks suitable for the parallel nature of such systems. We study the…
Cellular automata have been useful artificial models for exploring how relatively simple rules combined with spatial memory can give rise to complex emergent patterns. Moreover, studying the dynamics of how rules emerge under artificial…
We consider the problem of approximate sampling from the finite volume Gibbs measure with a general pair interaction. We exhibit a parallel dynamics (Probabilistic Cellular Automaton) which efficiently implements the sampling. In this…
Cellular automata (CA) dynamics are ordered in terms of two global parameters, computable {\sl a priori} from the description of rules. While one of them (activity) has been used before, the second one is new; it estimates the average…
We present a general conceptual framework for self-organized criticality (SOC), based on the recognition that it is nothing but the expression, ''unfolded'' in a suitable parameter space, of an underlying {\em unstable} dynamical critical…
We present a detailed description of the idea and procedure for the newly proposed Monte Carlo algorithm of tuning the critical point automatically, which is called the probability-changing cluster (PCC) algorithm [Y. Tomita and Y. Okabe,…
We propose a variant model of P{\'o}lya urn process, where the dynamics consist of two competing elements namely, suppression of growth and enhancement of dormant character. Here the level of such features are controlled by an internal…
We investigate critical properties of a class of number-conserving cellular automata (CA) which can be interpreted as deterministic models of traffic flow with anticipatory driving. These rules are among the only known CA rules for which…
Cellular automata are a discrete dynamical system which models massively parallel computation. Much attention is devoted to computations with small time complexity for which the parallelism may provide further possibilities. In this paper,…
In this paper we study in complete generality the family of two-state, deterministic, monotone, local, homogeneous cellular automata in $\mathbb{Z}^d$ with random initial configurations. Formally, we are given a set…
The probability distribution of the order parameter is exploited in order to obtain the criticality of magnetic systems. Monte Carlo simulations have been employed by using single spin flip Metropolis algorithm aided by finite-size scaling…
Taking the two-dimensional Ising model for example, short-time behavior of critical dynamics with a conserved order parameter is investigated by Monte Carlo simulations. Scaling behavior is observed, but the dynamic exponent $z$ is updating…
We study the predictability of emergent phenomena in complex systems. Using nearest neighbor, one-dimensional Cellular Automata (CA) as an example, we show how to construct local coarse-grained descriptions of CA in all classes of Wolfram's…
In this paper, we study the model-checking and parameter synthesis problems of the logic TCTL over discrete-timed automata where parameters are allowed both in the model (timed automaton) and in the property (temporal formula). Our results…
We investigate a one-dimensional three-species dynamical model whose dynamics naturally generate the semi-directed percolation cluster in time and show a non-equilibrium absorbing state phase transition from an active to inactive state. The…
We consider a probabilistic cellular automaton to analyze the stochastic dynamics of a predator-prey system. The local rules are Markovian and are based in the Lotka-Volterra model. The individuals of each species reside on the sites of a…