Related papers: Flexible Toggles and Symmetric Invertible Asynchro…
Cellular automata are often used to model systems in physics, social sciences, biology that are inherently asynchronous. Over the past 20 years, studies have demonstrated that the behavior of cellular automata drastically changed under…
We discuss a cellular automaton simulating the process of reaching Heider balance in a fully connected network. The dynamics of the automaton is defined by a deterministic, synchronous and global update rule. The dynamics has a very rich…
The proposed stochastic model for pedestrian dynamics is based on existing approaches using cellular automata, combined with substantial extensions, to compensate the deficiencies resulting of the discrete grid structure. This agent motion…
Diagrammatic sets are presheaves on a rich category of shapes, whose definition is motivated by combinatorial topology and higher-dimensional diagram rewriting. These shapes include representatives of oriented simplices, cubes, and positive…
In this paper, we perform a theoretical analysis of the sequential convergence of elementary cellular automata that have at least one fixed point. Our aim is to establish which elementary rules always reach fixed points under sequential…
We study the generic limit sets of one-dimensional cellular automata, which intuitively capture their asymptotic dynamics while discarding transient phenomena. As our main results, we characterize the automata whose generic limit set is a…
Both cellular automata (CA) and lattice-gas automata (LG) provide finite algorithmic presentations for certain classes of infinite dynamical systems studied by symbolic dynamics; it is customary to use the term `cellular automaton' or…
We study dynamical transportation networks in a framework that includes extensions of the classical Cell Transmission Model to arbitrary network topologies. The dynamics are modeled as systems of ordinary differential equations describing…
We describe a system of stochastic differential equations (SDEs) which model the interaction between processive molecular motors, such as kinesin and dynein, and the biomolecular cargo they tow as part of microtubule-based intracellular…
In this short paper, we compute the directional sequence entropy for of $\mathbb{Z}_+\times \mathbb{Z}$-actions generated by cellular automata and the shift map. Meanwhile, we study the directional dynamics of this system. As a corollary,…
We treat here the interrelation between formal languages and those dynamical systems that can be described by cellular automata (CA). There is a well-known injective map which identifies any CA-invariant subshift with a central formal…
We study the dominating set reconfiguration problem with the token sliding rule. It consists, given a graph G=(V,E) and two dominating sets D_s and D_t of G, in determining if there exists a sequence S=<D_1:=D_s,...,D_l:=D_t> of dominating…
This paper explores the orbit structure and homomesy (constant averages over orbits) properties of certain actions of toggle groups on the collection of independent sets of a path graph. In particular we prove a generalization of a homomesy…
A finite dynamical system (FDS) is a system of multivariate functions over a finite alphabet, that is typically used to model a network of interacting entities. The main feature of a finite dynamical system is its interaction graph, which…
Anomalies of global symmetries provide important information on the quantum dynamics. We show the dynamical constraints can be organized into three classes: genuine anomalies, fractional topological responses, and integer responses that can…
We prove that the set of subgroups of the automorphism group of a two-sided full shift is closed under countable graph products. We introduce the notion of a group action without $A$-cancellation (for an abelian group $A$), and show that…
The dynamical system described herein uses a hybrid cellular automata (CA) mechanism to attain reversibility, and this approach is adapted to create a novel block cipher algorithm called HCA. CA are widely used for modeling complex systems…
We propose a calibrated two-dimensional cellular automaton model to simulate pedestrian motion behavior. It is a v=4 (3) model with exclusion statistics and random shuffled dynamics. The underlying regular grid structure results in a…
The symmetric edge polytope ($\mathrm{SEP}$) of a finite simple graph $G$ is a centrally symmetric lattice polytope whose vertices are defined by the edges of the graph. Among the information encoded by these polytopes are the symmetries of…
Let $G=QD_{8k}~$ be the quasi-dihedral group of order $8n$ and $\theta$ be an automorphism of $QD_{8k}$ of finite order. The fixed-point set $H$ of $\theta$ is defined as $H_{\theta}=G^{\theta}=\{x\in G \mid \theta(x)=x\}$ and generalized…