English
Related papers

Related papers: Wave propagation in filamental cellular automata

200 papers

The dispersal of cells from an initially constrained location is a crucial aspect of many physiological phenomena ranging from morphogenesis to tumour spreading. In such processes, the way cell-cell interactions impact the motion of single…

A deterministic cellular automaton rule defined on the Moore neighbourhood is studied as a model of epidemic propagation. The directed nature of the interaction between cells allows one to introduce the dependence on a disorder parameter…

Statistical Mechanics · Physics 2007-05-23 M. Bezzi , R. Livi

Reproduction, development, and individual interactions are essential topics in artificial life. The cellular automata, which can handle these in a composite way, is highly restricted in its form and behavior because it represents life as a…

Neural and Evolutionary Computing · Computer Science 2022-11-29 Keishu Utimula

This paper presents a classification of Cellular Automata rules based on its properties at the nth iteration. Elaborate computer program has been designed to get the nth iteration for arbitrary 1-D or 2-D CA rules. Studies indicate that the…

The notions of universality and completeness are central in the theories of computation and computational complexity. However, proving lower bounds and necessary conditions remains hard in most of the cases. In this article, we introduce…

Discrete Mathematics · Computer Science 2010-09-17 Eric Goles Chacc , Pierre-Etienne Meunier , Ivan Rapaport , Guillaume Theyssier

Crowd simulation is used for evacuation and crowd safety inspections, study of performance in crowd systems and animations. Cellular automata has been extensively used in modelling the crowd. In regular cellular automata models, each…

Other Computer Science · Computer Science 2014-06-16 Siamak Sarmady , Fazilah Haron , Abdullah Zawawi Talib

A method for studying the qualitative dynamical properties of abstract computing machines based on the approximation of their program-size complexity using a general lossless compression algorithm is presented. It is shown that the…

Computational Complexity · Computer Science 2011-01-24 Hector Zenil

The homeostasis of epithelial tissue relies on a balance between the self-renewal of stem cell populations, cellular differentiation, and loss. Although this balance needs to be tightly regulated to avoid pathologies, such as tumor growth,…

Biological Physics · Physics 2024-04-10 Johannes C. Krämer , Edouard Hannezo , Gerhard Gompper , Jens Elgeti

Multicellular organisms comprise a diverse collection of stable tissues built from different cell types. It remains unclear how large numbers of interacting cells can precisely coordinate their gene expression during tissue…

Biological Physics · Physics 2022-10-31 Matthew Smart , Anton Zilman

The filamentation instability of counterpropagating symmetric beams of electrons is examined with 1D and 2D particle-in-cell (PIC) simulations, which are oriented orthogonally to the beam velocity vector. The beams are uniform, warm and…

Plasma Physics · Physics 2015-05-14 M E Dieckmann

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…

Neural and Evolutionary Computing · Computer Science 2021-08-03 Barbora Hudcová , Tomáš Mikolov

We study cellular automata with respect to a new communication complexity problem: each of two players know half of some finite word, and must be able to tell whether the state of the central cell will follow a given evolution, by…

Formal Languages and Automata Theory · Computer Science 2011-02-18 Eric Goles , Pierre Guillon , Ivan Rapaport

Global dynamics of a non-linear Cellular Automata is, in general irregular, asymmetric and unpredictable as opposed to that of a linear CA, which is highly systematic and tractable. In the past efforts have been made to systematize…

Computational Complexity · Computer Science 2008-08-13 Sudhakar Sahoo , Pabitra Pal Choudhury , Mithun Chakraborty

This note is a survey of examples and results about cellular automata with the purpose of recalling that there is no 'universal' way of being computationally universal. In particular, we show how some cellular automata can embed efficient…

Computational Complexity · Computer Science 2021-12-03 Guillaume Theyssier

This paper studies directional dynamics in cellular automata, a formalism previously introduced by the third author. The central idea is to study the dynamical behaviour of a cellular automaton through the conjoint action of its global rule…

Discrete Mathematics · Computer Science 2010-08-23 Martin Delacourt , Victor Poupet , Mathieu Sablik , Guillaume Theyssier

We show that cellular automata can classify data by inducing a form of dynamical phase coexistence. We use Monte Carlo methods to search for general two-dimensional deterministic automata that classify images on the basis of activity, the…

Neural and Evolutionary Computing · Computer Science 2023-08-02 Stephen Whitelam , Isaac Tamblyn

We investigate the use of an extension of rule-based modelling for cellular signalling to create a structured space of model variants. This enables the incremental development of rule sets that start from simple mechanisms and which, by a…

Other Computer Science · Computer Science 2009-11-16 Russ Harmer

Motor proteins drive persistent motion and self-organisation of cytoskeletal filaments. However, state-of-the-art microscopy techniques and continuum modelling approaches focus on large length and time scales. Here, we perform…

Soft Condensed Matter · Physics 2024-06-03 Gerrit Vliegenthart , Arvind Ravichandran , Marisol Ripoll , Thorsten Auth , Gerhard Gompper

Signals are a classical tool used in cellular automata constructions that proved to be useful for language recognition or firing-squad synchronisation. Particles and collisions formalize this idea one step further, describing regular nets…

Computational Complexity · Computer Science 2009-06-22 Nicolas Ollinger , Gaétan Richard

We study locally interacting processes in discrete time, often called probabilistic cellular automata, indexed by locally finite graphs. For infinite regular trees and certain generalized Galton-Watson trees, we show that the marginal…

Probability · Mathematics 2025-10-28 Daniel Lacker , Kavita Ramanan , Ruoyu Wu