Related papers: A Language for Particle Interactions in One-dimens…
We study the joint asymptotic behavior of spacings between particles at the edge of multilevel Dyson Brownian motions, when the number of levels tends to infinity. Despite the global interactions between particles in multilevel Dyson…
In recent years statistical physicists have developed {\it discrete} "particle-hopping" models of vehicular traffic, usually formulated in terms of {\it cellular automata}, which are similar to the microscopic models of interacting charged…
There have been several highway traffic models proposed based on cellular automata. The simplest one is elementary cellular automaton rule 184. We extend this model to city traffic with cellular automata coupled at intersections using only…
Cellular automata provide models of parallel computation based on cells, whose connectivity is given by an action of a monoid on the cells. At each step in the computation, every cell is decorated with a state that evolves in discrete steps…
We propose a four-way classification of two-dimensional semi-totalistic cellular automata that is different than Wolfram's, based on two questions with yes-or-no answers: do there exist patterns that eventually escape any finite bounding…
We report three-dimensional particle mechanics static calculations that predict the microstructure evolution during die-compaction of elastic spherical particles up to relative densities close to one. We employ a nonlocal contact…
Particle-core interaction is the well-developed model of halo formation in high-intensity beams. In present paper an analytical solution for averaged single particle dynamics around uniformly charged beam core is obtained. The problem is…
Cellular automata represent physical systems where both space and time are discrete, and the associated physical quantities assume a limited set of values. While previous research has applied cellular automata in modeling chemical,…
One of the most important problems in contemporary science, and especially in biology, is to reveal mechanisms of pattern formation. On the level of biological tissues, patterns form due to interactions between cells. These interactions can…
Classical Cellular Automata (CCAs) are a powerful computational framework for modeling global spatio-temporal dynamics with local interactions. While CCAs have been applied across numerous scientific fields, identifying the local rule that…
By exploring possible physical sense of notions, structures, and logic in a class of noncommutative geometries, we try to unify the four fundamental interactions within an axiomatic quantum picture. We identify the objects and algebraic…
This paper proposes a new pattern of two dimensional cellular automata linear rules that are used for efficient edge detection of an image. Since cellular automata is inherently parallel in nature, it has produced desired output within a…
Fungal automata are a nature-inspired computational model, where a rule is alternatively applied verticaly and horizontaly. In this work we study the computational complexity of predicting the dynamics of all fungal freezing totalistic…
We consider the parity problem in one-dimensional, binary, circular cellular automata: if the initial configuration contains an odd number of 1s, the lattice should converge to all 1s; otherwise, it should converge to all 0s. It is easy to…
We present a method for computing probability of occurence of 1s in a configuration obtained by iteration of a probabilistic cellular automata (PCA), starting from a random initial configuration. If the PCA is sufficiently simple, one can…
It is plausible that the dark matter particles have non-gravitational interactions among themselves. If such self interactions are large enough, they could leave an imprint on the morphology of galaxies. These effects can be studied with…
We investigate the ability of a genetic algorithm to design cellular automata that perform computations. The computational strategies of the resulting cellular automata can be understood using a framework in which ``particles'' embedded in…
We propose a model of mobile agents to construct social networks, based on a system of moving particles by keeping track of the collisions during their permanence in the system. We reproduce not only the degree distribution, clustering…
A novel, information-based classification of elementary cellular automata is proposed that circumvents the problems associated with isolating whether complexity is in fact intrinsic to a dynamical rule, or if it arises merely as a product…
We define and explore in simulation several rules for the local evolution of generative rules for 1D and 2D cellular automata. Our implementation uses strategies from conceptual blending. We discuss potential applications to modelling…