Related papers: Cellular Automata Models for Diffusion of Innovati…
This paper studies probabilistic rates of convergence for consensus+innovations type of algorithms in random, generic networks. For each node, we find a lower and also a family of upper bounds on the large deviations rate function, thus…
We consider the problem of average consensus in a distributed system comprising a set of nodes that can exchange information among themselves. We focus on a class of algorithms for solving such a problem whereby each node maintains a state…
We introduce and study cellular automata whose cell spaces are left-homogeneous spaces. Examples of left-homogeneous spaces are spheres, Euclidean spaces, as well as hyperbolic spaces acted on by isometries; uniform tilings acted on by…
This paper models information diffusion in a network of Large Language Models (LLMs) that is designed to answer queries from distributed datasets, where the LLMs can hallucinate the answer. We introduce a two-time-scale dynamical model for…
We study a non-ergodic one-dimensional probabilistic cellular automata, where each component can assume the states $\+$ and $\-.$ We obtained the limit distribution for a set of measures on $\{\+,\-\}^\Z.$ Also, we show that for certain…
Invertible cellular automata are useful as models of physical systems with microscopically revesible dyanmics. There are several well-understood ways to construct them: partitioning rules, second-order rules, and alternating-grid rules. We…
In this study we examined how the size of non-formal groups between organization members affect the transfer of knowledge in the context of the efficiency and effectiveness of this process. To analyse the dynamics of the transfer of…
Cellular automata are discrete and computational models thatcan be shown as general models of complexity. They are used in varied applications to derive the generalized behavior of the presented model. In this paper we have took one such…
Crowd simulation models are used to assess the performance and safety of crowd systems. In some systems, wheelchairs and other moving objects are present in the crowd. The different size and speed of the wheelchairs could significantly…
Cellular automata are widely used to model natural or artificial systems. Classically they are run with perfect synchrony, i.e., the local rule is applied to each cell at each time step. A possible modification of the updating scheme…
A model, applicable to a range of innovation diffusion applications with a strong peer to peer component, is developed and studied, along with methods for its investigation and analysis. A particular application is to individual households…
Cyclic cellular automata (CCA) are models of excitable media. Started from random initial conditions, they produce several different kinds of spatial structure, depending on their control parameters. We introduce new tools from information…
Cellular networks are usually modeled by placing the base stations on a grid, with mobile users either randomly scattered or placed deterministically. These models have been used extensively but suffer from being both highly idealized and…
Cellular automata (CA) can be viewed as maps in the space of probability measures. Such maps are normally infinitely-dimensional, and in order to facilitate investigations of their properties, especially in the context of applications,…
Cellular automata are fully-discrete, spatially-extended dynamical systems that evolve by simultaneously applying a local update function. Despite their simplicity, the induced global dynamic produces a stunning array of richly-structured,…
With the popularity of portable wireless devices it is important to model and predict how information or contagions spread by natural human mobility -- for understanding the spreading of deadly infectious diseases and for improving delay…
We propose some conjectures for asymptotic distribution of probabilistic Burgers cellular automaton (PBCA) which is defined by a simple motion rule of particles including a probabilistic parameter. Asymptotic distribution of configurations…
We investigate Boolean, totalistic cellular automata with a majority or frustrated majority vote rule, and an interaction range of variable span. These two models show a behavior which differs from the mean-field one. The majority vote…
We define a stochastic reaction-diffusion process that describes a consensus formation in a non-sedentary population. The process is a diffusive version of the Majority Vote model, where the state update follows two stages: in the first…
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…