Related papers: Probabilistic Cellular Automata for Granular Media…
Many natural processes occur over characteristic spatial and temporal scales. This paper presents tools for (i) flexibly and scalably coarse-graining cellular automata and (ii) identifying which coarse-grainings express an automaton's…
We present some computer simulations run on a stochastic CA (cellular automaton). The CA simulates a gas of particles which are in a channel, the interval $[1,L]$ in $\mathbb Z$, but also in "reservoirs" $\mathcal R_1$ and $\mathcal R_2$.…
A broad range of computational models have been proposed to predict microstructure development during solidification processing but they have seldom been compared to each other on a quantitative and systematic basis. In this paper, we…
Sandpiles have become paradigmatic systems for granular flow studies in statistical physics. New directions of investigations are discussed here. Rather than varying the nature of the pile (sand, salt, rice,..) we have investigated changes…
Cellular Automata are discrete dynamical systems that evolve following simple and local rules. Despite of its local simplicity, knowledge discovery in CA is a NP problem. This is the main motivation for using data mining techniques for CA…
Cellular automata (CA) are discrete-time dynamical systems with local update rules on a lattice. Despite their elementary definition, CA support a wide spectrum of macroscopic phenomena central to statistical physics: equilibrium and…
Unconventional computing devices are increasingly of interest as they can operate in environments hostile to silicon-based electronics, or compute in ways that traditional electronics cannot. Mechanical computers, wherein information…
A cellular automaton is a deterministic and exactly computable dynamical system which mimics certain fundamental aspects of physical dynamics such as spatial locality and finite entropy. CA systems can be constructed which have additional…
Probabilistic cellular automata with deterministic updating are quantum systems. We employ the quantum formalism for an investigation of random probabilistic cellular automata, which start with a probability distribution over initial…
Cellular automata are a class of computational models based on simple rules and algorithms that can simulate a wide range of complex phenomena. However, when using conventional computers, these 'simple' rules are only encapsulated at the…
This paper studies 2-player impartial combinatorial games, where the outcomes correspond to updates of cellular automata (CA) which generalize Wolfram's elementary rule 60 and rule 110 (Cook 2004). The games extend the class of…
Granular media surround us, comprising everything from the ground we walk on to the foods we eat. Owing to their ubiquity our ability to understand and predict the mechanical evolution of grains is not only of key scientific importance, but…
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…
The calcium transport in biological systems is modelled as a reaction-diffusion process. Nonlinear calcium waves are then simulated using a stochastic cellular automaton whose rules are derived from the corresponding coupled partial…
Sand pile formation is often used to describe stratified chaos in dynamic systems due to self-emergent and scale invariant behaviour. Cellular automata (Bak-Tang-Wiesenfeld model) are often used to describe chaotic behaviour, as simulating…
In previous works, hexagonal cellular automata (CA) have been studied as a variation of the famous Game of Life CA, mainly for spiral phenomena simulations; where the most interesting constructions are related to the Belousov-Zhabotinsky…
Cellular automata (CA) are a class of computational models that exhibit rich dynamics emerging from the local interaction of cells arranged in a regular lattice. In this work we focus on a generalised version of typical CA, called graph…
We present a probabilistic 3D generative model, named Generative Cellular Automata, which is able to produce diverse and high quality shapes. We formulate the shape generation process as sampling from the transition kernel of a Markov…
Computer simulations of plasmas are relevant nowadays, because it helps us understand physical processes taking place in the sun and other stellar objects. We developed a program called PCell which is intended for displaying the evolution…
3D Computer simulations and experiments are employed to study random packings of compressible spherical grains under external confining stress. Of particular interest is the rigid ball limit, which we describe as a continuous transition in…