Searcharxiv⌕ Search

SEARCH · Searcharxiv

Results for “nlin.CG”

Search indexed arXiv papers on artificial intelligence, large language models, computer vision and robotics. Read source abstracts and follow links to arXiv.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 469 records · Page 26Linked to original sources
arXiv2023

Flow-Lenia: Towards open-ended evolution in cellular automata through mass conservation and parameter localization

The design of complex self-organising systems producing life-like phenomena, such as the open-ended evolution of virtual creatures, is one of the main goals of artificial life. Lenia, a family of cellular automata (CA) generalizing Conway's Game of Life to continuous space, time and states, has attracted a lot of attention because of the wide diversity of self-organizing patterns it can generate. Among those, some spatially localized patterns (SLPs) resemble life-like artificial creatures and display complex behaviors. However, those creatures are found in only a small subspace of the Lenia parameter space and are not trivial to discover, necessitating advanced search algorithms. Furthermore, each of these creatures exist only in worlds governed by specific update rules and thus cannot interact in the same one. This paper proposes as mass-conservative extension of Lenia, called Flow Lenia, that solve both of these issues. We present experiments demonstrating its effectiveness in generating SLPs with complex behaviors and show that the update rule parameters can be optimized to generate SLPs showing behaviors of interest. Finally, we show that Flow Lenia enables the integration of the parameters of the CA update rules within the CA dynamics, making them dynamic and localized, allowing for multi-species simulations, with locally coherent update rules that define properties of the emerging creatures, and that can be mixed with neighbouring rules. We argue that this paves the way for the intrinsic evolution of self-organized artificial life forms within continuous CAs.

cs.NE↗
arXiv2023

Asymptotic solution to a fuzzy elementary cellular automaton of rule number 38

Fuzzy cellular automaton is a dynamical system with a continuous state value embedding a cellular automaton with a discrete state value. We investigate a fuzzy cellular automaton obtained from an elementary cellular automaton of rule number 38. Its asymptotic solutions are classified into two types. One is a solution where stable propagating waves exist, and the other is a static uniform solution of constant value.

nlin.CG↗
arXiv2026

Relationships between two linearizations of the box-ball system : Kerov-Kirillov-Reshetikhin bijection and slot configuration

The box-ball system (BBS), which was introduced by Takahashi and Satsuma in 1990, is a soliton cellular automaton. Its dynamics can be linearized by a few methods, among which the best known is the Kerov-Kirillov-Reshetikhin (KKR) bijection using rigged partitions. Recently a new linearization method in terms of "slot configurations" was introduced by Ferrari-Nguyen-Rolla-Wang, but its relations to existing ones have not been clarified. In this paper we investigate this issue and clarify the relation between the two linearizations. For this we introduce a novel way of describing the BBS dynamics using a carrier with seat numbers. We show that the seat number configuration also linearizes the BBS and reveals explicit relations between the KKR bijection and the slot configuration. In addition, by using these explicit relations, we also show that even in case of finite carrier capacity the BBS can be linearized via the slot configuration.

math.CO↗
arXiv2023

Thermodynamics in Stochastic Conway Game of Life

Cellular automata can simulate many complex physical phenomena using the power of simple rules. The presented methodological platform expresses the concept of programmable matter in which Newtons laws of motion are one of examples. Energy has been introduced as the equivalent of the Game of Life mass, which can be treated as first level of approximation. The temperature presence and propagation was calculated for various lattice topology and boundary conditions by using the Shannon entropy measure. The conducted study provides strong evidence that despite not fulfillment the principle of mass and energy conservation, the entropy, mass distribution and temperatures approaches thermodynamic equilibrium. In addition, the described cellular automata system transits from positive to a negative temperatures that stabilizes and can be treated as a signature of system dynamical equilibrium. Furthermore the system dynamics was presented in case of few species of cellular automata competing for maximum presence on given lattice with different boundary conditions.

nlin.CG↗
arXiv2023

Powerful ordered collective heat engines

We introduce a class of stochastic engines in which the regime of units operating synchronously can boost the performance. Our approach encompasses a minimal setup composed of $N$ interacting units placed in contact with two thermal baths and subjected to a constant driving worksource. The interplay between unit synchronization and interaction leads to an efficiency at maximum power between the Carnot, $η_{c}$, and the Curzon-Ahlborn bound, $η_{CA}$. Moreover, these limits can be respectively saturated maximizing the efficiency, and by simultaneous optimization of power and efficiency. We show that the interplay between Ising-like interactions and a collective ordered regime is crucial to operate as a heat engine. The main system features are investigated by means of a linear analysis near equilibrium, and developing an effective discrete-state model that captures the effects of the synchronous phase. The present framework paves the way for the building of promising nonequilibrium thermal machines based on ordered structures.

cond-mat.stat-mech↗
arXiv2023

Unconventional criticality, scaling breakdown, and diverse universality classes in the Wilson-Cowan model of neural dynamics

The Wilson-Cowan model constitutes a paradigmatic approach to understanding the collective dynamics of networks of excitatory and inhibitory units. It has been profusely used in the literature to analyze the possible phases of neural networks at a mean-field level, e.g., assuming large fully-connected networks. Moreover, its stochastic counterpart allows one to study fluctuation-induced phenomena, such as avalanches. Here, we revisit the stochastic Wilson-Cowan model paying special attention to the possible phase transitions between quiescent and active phases. We unveil eight possible types of phase transitions, including continuous ones with scaling behavior belonging to known universality classes -- such as directed percolation and tricritical directed percolation -- as well as novel ones. In particular, we show that under some special circumstances, at a so-called Hopf tricritical directed percolation transition, rather unconventional behavior including an anomalous breakdown of scaling emerges. These results broaden our knowledge of the possible types of critical behavior in networks of excitatory and inhibitory units and are of relevance to understanding avalanche dynamics in actual neuronal recordings. From a more general perspective, these results help extend the theory of non-equilibrium phase transitions into quiescent or absorbing states.

cond-mat.stat-mech↗
arXiv2025

Parameter estimation for cellular automata

Self-organizing complex systems can be modeled using cellular automaton models. However, the parametrization of these models is crucial and significantly determines the resulting structural pattern. In this research, we introduce and successfully apply a sound statistical method to estimate these parameters. The decisive difference to earlier applications of such approaches is that, in our case, both the CA rules and the resulting patterns are discrete. The method is based on constructing Gaussian likelihoods using characteristics of the structures, such as the mean particle size. We show that our approach is robust for the method parameters, domain size of patterns, or CA iterations.

nlin.CG↗
arXiv2023

On the Garden of Eden theorem for non-uniform cellular automata

We establish several extensions of the well-known Garden of Eden theorem for non-uniform cellular automata over the full shifts and over amenable group universes. In particular, our results describe quantitatively the relations between the partial pre-injectivity and the size of the image of a non-uniform cellular automata. A strengthened surjunctivity result is also obtained for multi-dimensional cellular automata over strongly irreducible subshifts of finite type.

math.DS↗
arXiv2023

Towards Large-Scale Simulations of Open-Ended Evolution in Continuous Cellular Automata

Inspired by biological and cultural evolution, there have been many attempts to explore and elucidate the necessary conditions for open-endedness in artificial intelligence and artificial life. Using a continuous cellular automata called Lenia as the base system, we built large-scale evolutionary simulations using parallel computing framework JAX, in order to achieve the goal of never-ending evolution of self-organizing patterns. We report a number of system design choices, including (1) implicit implementation of genetic operators, such as reproduction by pattern self-replication, and selection by differential existential success; (2) localization of genetic information; and (3) algorithms for dynamically maintenance of the localized genotypes and translation to phenotypes. Simulation results tend to go through a phase of diversity and creativity, gradually converge to domination by fast expanding patterns, presumably a optimal solution under the current design. Based on our experimentation, we propose several factors that may further facilitate open-ended evolution, such as virtual environment design, mass conservation, and energy constraints.

cs.NE↗
arXiv2023

Where is the Edge of Chaos?

Previous study of cellular automata and random Boolean networks has shown emergent behavior occurring at the edge of chaos where the randomness (disorder) of internal connections is set to an intermediate critical value. The value at which maximal emergent behavior occurs has been observed to be inversely related to the total number of interconnected elements, the neighborhood size. However, different equations predict different values. This paper presents a study of one-dimensional cellular automata (1DCA) verifying the general relationship but finding a more precise correlation with the radius of the neighborhood rather than neighborhood size. Furthermore, the critical value of the emergent regime is observed to be very close to 1/e hinting at the discovery of a fundamental characteristic of emergent systems.

nlin.CG↗
arXiv2023

Self-Replicating Hierarchical Structures Emerge in a Binary Cellular Automaton

We have discovered a novel transition rule for binary cellular automata (CA) that yields self-replicating structures across two spatial and temporal scales from sparsely populated random initial conditions. Lower-level, shapeshifting clusters frequently follow a transient attractor trajectory, generating new clusters, some of which periodically self-duplicate. When the initial distribution of live cells is sufficiently sparse, these clusters coalesce into larger formations that also self-replicate. These formations may further form the boundaries of an expanding complex on an even larger scale. This rule, dubbed ``Outlier,'' is rotationally symmetric and applies to 2D Moore neighborhoods. It was evolved through Genetic Programming during an extensive automated search for rules that foster open-ended evolution in CA. While self-replicating structures, both crafted and emergent, have been created in CA with state sets intentionally designed for this purpose, the Outlier may be the first known rule to facilitate emergent self-replication across two spatial scales in simple binary CA.

nlin.CG↗
arXiv2023

A strongly universal cellular automaton on the pentagrid with six states and Moore neighbourhood

In this paper, we prove that there is a strongly universal cellular automaton on the pentagrid with six states. For each cell c, Moore neighbourhood consists of the cells which share a vertex with c. Moreover, the rules are rotation invariant. There are 1072 of them. The result is different from arXiv:2306.06728. The present paper deals with the pentagrid and not with the heptagrid, it is not at all the same context although the implementated model is basically the same. The implementation of that model is different from the quoted arXiv paper.

nlin.CG↗
arXiv2023

Locally adaptive cellular automata for goal-oriented self-organization

The essential ingredient for studying the phenomena of emergence is the ability to generate and manipulate emergent systems that span large scales. Cellular automata are the model class particularly known for their effective scalability but are also typically constrained by fixed local rules. In this paper, we propose a new model class of adaptive cellular automata that allows for the generation of scalable and expressive models. We show how to implement computation-effective adaptation by coupling the update rule of the cellular automaton with itself and the system state in a localized way. To demonstrate the applications of this approach, we implement two different emergent models: a self-organizing Ising model and two types of plastic neural networks, a rate and spiking model. With the Ising model, we show how coupling local/global temperatures to local/global measurements can tune the model to stay in the vicinity of the critical temperature. With the neural models, we reproduce a classical balanced state in large recurrent neuronal networks with excitatory and inhibitory neurons and various plasticity mechanisms. Our study opens multiple directions for studying collective behavior and emergence.

cs.NE↗
arXiv2024

Probabilistic cellular automata with Andrei Toom

Andrei Toom, who died in September 2022, contributed some of the most fundamental results on probabilistic cellular automata. We want to acquaint the reader with these and will also try to give the reader a look at the environment in which they were born. Toom was an original and strong personality, and other aspects of his life (education, literature) will also deserve mention.

nlin.CG↗
arXiv2023

Towards quantization Conway Game of Life

Classical stochastic Conway Game of Life is expressed by the dissipative Schrödinger equation and dissipative tight-binding model. This is conducted at the prize of usage of time dependent anomalous non-Hermitian Hamiltonians as with occurrence of complex value potential that do not preserve the normalization of wave-function and thus allows for mimicking creationism or annihilationism of cellular automaton. Simply saying time-dependent complex value eigenenergies are similar to complex values of resonant frequencies in electromagnetic resonant cavities reflecting presence of dissipation that reflects energy leaving the system or being pumped into the system. At the same time various aspects of thermodynamics were observed in cellular automata that can be later reformulated by quantum mechanical pictures. The usage of Shannon entropy and mass equivalence to energy points definition of cellular automata temperature. Contrary to intuitive statement the system dynamical equilibrium is always reflected by negative temperatures. Diffusion of mass, energy and temperature as well as phase of proposed wave function is reported and can be directly linked with second thermodynamics law approximately valid for the system, where neither mass nor energy is conserved. The concept of complex-valued mass mimics wave-function behavior. Equivalence an anomalous second Fick law and dissipative Schrödinger equation is given. Dissipative Conway Game of Life tight-binding Hamiltonian is given using phenomenological justification.

cond-mat.dis-nn↗
arXiv2023

Generalized ARRIVAL Problem for Rotor Walks in Path Multigraphs

Rotor walks are cellular automata that determine deterministic traversals of particles in a directed multigraph using simple local rules, yet they can generate complex behaviors. Furthermore, these trajectories exhibit statistical properties similar to random walks. In this study, we investigate a generalized version of the reachability problem known as ARRIVAL in Path Multigraphs, which involves predicting the number of particles that will reach designated target vertices. We show that this problem is in NP and co-NP in the general case. However, we exhibit algebraic invariants for Path Multigraphs that allow us to solve the problem efficiently, even for an exponential configuration of particles. These invariants are based on harmonic functions and are connected to the decomposition of integers in rational bases.

cs.DM↗
arXiv2023

Words fixing the kernel network and maximum independent sets in graphs

The simple greedy algorithm to find a maximal independent set of a graph can be viewed as a sequential update of a Boolean network, where the update function at each vertex is the conjunction of all the negated variables in its neighbourhood. In general, the convergence of the so-called kernel network is complex. A word (sequence of vertices) fixes the kernel network if applying the updates sequentially according to that word. We prove that determining whether a word fixes the kernel network is coNP-complete. We also consider the so-called permis, which are permutation words that fix the kernel network. We exhibit large classes of graphs that have a permis, but we also construct many graphs without a permis.

cs.DM↗