Tootfinder

Counting Short Trajectories in Elementary Cellular Automata using the Transfer Matrix Method
C\'edric Koller, Barbora Hudcov\'a
https://arxiv.org/abs/2508.09768 https://…

Counting Short Trajectories in Elementary Cellular Automata using the Transfer Matrix Method
Elementary Cellular Automata (ECAs) exhibit diverse behaviours often categorized by Wolfram's qualitative classification. To provide a quantitative basis for understanding these behaviours, we investigate the global dynamics of such automata and we describe a method that allows us to compute the number of all configurations leading to short attractors in a limited number of time steps. This computation yields exact results in the thermodynamic limit (as the CA grid size grows to infinity), and …

Growing Reservoirs with Developmental Graph Cellular Automata
Matias Barandiaran, James Stovold
https://arxiv.org/abs/2508.08091 https://arxiv.org/pdf/2508…

Growing Reservoirs with Developmental Graph Cellular Automata
Developmental Graph Cellular Automata (DGCA) are a novel model for morphogenesis, capable of growing directed graphs from single-node seeds. In this paper, we show that DGCAs can be trained to grow reservoirs. Reservoirs are grown with two types of targets: task-driven (using the NARMA family of tasks) and task-independent (using reservoir metrics). Results show that DGCAs are able to grow into a variety of specialized, life-like structures capable of effectively solving benchmark tasks, stat…

Reversibility, balance and expansivity of non-uniform cellular automata
Katariina Paturi
https://arxiv.org/abs/2507.06896 https://arx…

Reversibility, balance and expansivity of non-uniform cellular automata
Non-uniform cellular automata (NUCA) are an extension of cellular automata (CA), which transform cells according to multiple different local rules. A NUCA is defined by a configuration of local rules called a local rule distribution. We examine what properties of uniform CA can be recovered by restricting the rule distribution to be (uniformly) recurrent, focusing on only 1D NUCA. We show that a bijective NUCA with a uniformly recurrent rule distribution is reversible. We also show that if a …

Clifford quantum cellular automata from topological quantum field theories and invertible subalgebras
Meng Sun, Bowen Yang, Zongyuan Wang, Nathanan Tantivasadakarn, Yu-An Chen
https://arxiv.org/abs/2509.07099

Clifford quantum cellular automata from topological quantum field theories and invertible subalgebras
We present a general framework for constructing quantum cellular automata (QCA) from topological quantum field theories (TQFT) and invertible subalgebras (ISA) using the cup-product formalism. This approach explicitly realizes all $\mathbb{Z}_2$ and $\mathbb{Z}_p$ Clifford QCAs (for prime $p$) in all admissible dimensions, in precise agreement with the classification predicted by algebraic $L$-theory. We determine the orders of these QCAs by explicitly showing that finite powers reduce to the i…

On the Convergence of Elementary Cellular Automata under Sequential Update Modes
Isabel Donoso-Leiva, Eric Goles, Mart\'in R\'ios-Wilson, Sylvain Sen\'e
https://arxiv.org/abs/2509.07797

On the Convergence of Elementary Cellular Automata under Sequential Update Modes
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 update modes, regardless of the initial configuration. In this context, we classify these rules according to whether all initial configurations converge under all, some, one or none sequential update modes, depending on if they have fixed points under synchronou…

Crosslisted article(s) found for nlin.CG. https://arxiv.org/list/nlin.CG/new
[1/1]:
- Random Permutation Circuits are Quantum Chaotic
Bruno Bertini, Katja Klobas, Pavel Kos, Daniel Malz

Expedition & Expansion: Leveraging Semantic Representations for Goal-Directed Exploration in Continuous Cellular Automata
Sina Khajehabdollahi, Gautier Hamon, Marko Cvjetko, Pierre-Yves Oudeyer, Cl\'ement Moulin-Frier, C\'edric Colas
https://arxiv.org/abs/2509.03863

Expedition & Expansion: Leveraging Semantic Representations for Goal-Directed Exploration in Continuous Cellular Automata
Discovering diverse visual patterns in continuous cellular automata (CA) is challenging due to the vastness and redundancy of high-dimensional behavioral spaces. Traditional exploration methods like Novelty Search (NS) expand locally by mutating known novel solutions but often plateau when local novelty is exhausted, failing to reach distant, unexplored regions. We introduce Expedition and Expansion (E&E), a hybrid strategy where exploration alternates between local novelty-driven expansions an…

A 10-bit S-box generated by Feistel construction from cellular automata
Thomas Pr\'evost (I3S), Bruno Martin (I3S)
https://arxiv.org/abs/2507.02489 htt…

A 10-bit S-box generated by Feistel construction from cellular automata
We propose a new 10-bit S-box generated from a Feistel construction. The subpermutations are generated by a 5-cell cellular automaton based on a unique well-chosen rule and bijective affine transformations. In particular, the cellular automaton rule is chosen based on empirical tests of its ability to generate good pseudorandom output on a ring cellular automaton. Similarly, Feistel's network layout is based on empirical data regarding the quality of the output S-box. We perform cryptanalysis o…

Gaussian concentration bounds for probabilistic cellular automata
Jean-Ren\'e Chazottes, Frank Redig, Edgardo Ugalde
https://arxiv.org/abs/2507.05431 h…

Gaussian concentration bounds for probabilistic cellular automata
We study lattice spin systems and analyze the evolution of Gaussian concentration bounds (GCB) under the action of probabilistic cellular automata (PCA), which serve as discrete-time analogues of Markovian spin-flip dynamics. We establish the conservation of GCB and, in the high-noise regime, demonstrate that GCB holds for the unique stationary measure. Additionally, we prove the equivalence of GCB for the space-time measure and its spatial marginals in the case of contractive probabilistic cel…

Identity Increases Stability in Neural Cellular Automata
James Stovold
https://arxiv.org/abs/2508.06389 https://arxiv.org/pdf/2508.06389

Identity Increases Stability in Neural Cellular Automata
Neural Cellular Automata (NCAs) offer a way to study the growth of two-dimensional artificial organisms from a single seed cell. From the outset, NCA-grown organisms have had issues with stability, their natural boundary often breaking down and exhibiting tumour-like growth or failing to maintain the expected shape. In this paper, we present a method for improving the stability of NCA-grown organisms by introducing an 'identity' layer with simple constraints during training. Results show that…

On the surjunctivity and the Garden of Eden theorem for non-uniform cellular automata
Katariina Paturi, Jarkko Kari
https://arxiv.org/abs/2507.06987 https:…

On the surjunctivity and the Garden of Eden theorem for non-uniform cellular automata
Non-uniform cellular automata (NUCA) are an extension of cellular automata with multiple local rules in different cells. We show that if the distribution of local rules is uniformly recurrent, or recurrent in the one-dimensional case, the Garden of Eden theorem holds. We also show that for any non-recurrent distribution, there is a substitution of local rules that defines a NUCA which does not satisfy the Garden of Eden theorem. Finally, we show that a rule distribution asymptotic to recurrent …

Causal Decompositions of 1D Quantum Cellular Automata
Augustin Vanrietvelde, Octave Mestoudjian, Pablo Arrighi
https://arxiv.org/abs/2506.22219 https://

Causal Decompositions of 1D Quantum Cellular Automata
Understanding quantum theory's causal structure stands out as a major matter, since it radically departs from classical notions of causality. We present advances in the research program of causal decompositions, which investigates the existence of an equivalence between the causal and the compositional structures of unitary channels. Our results concern one-dimensional Quantum Cellular Automata (1D QCAs), i.e. unitary channels over a line of $N$ quantum systems (with or without periodic boundar…

[2025-08-14 Thu (UTC), 1 new article found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

Identification of Cellular Automata on Spaces of Bernoulli Probability Measures
Faizal Hafiz, Amelia Kunze, Enrico Formenti, Davide La Torre
https://arxiv.org/abs/2506.22867

Identification of Cellular Automata on Spaces of Bernoulli Probability Measures
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 governs observed dynamics remains a challenging task. Moreover, the underlying assumption of deterministic cell states often limits the applicability of CCAs to systems characterized by inherent uncertainty. This study, therefore, focuses on the identificatio…

[2025-08-15 Fri (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

Replaced article(s) found for cs.FL. https://arxiv.org/list/cs.FL/new
[1/1]:
- Universality Frontier for Asynchronous Cellular Automata
Ivan Baburin, Matthew Cook, Florian Gr\"otschla, Andreas Plesner, Roger Wattenhofer

Cellular Automata as Generators of Interleaving Sequences
Sara D. Cardell
https://arxiv.org/abs/2506.18848 https://arxiv.org/pdf/2506…

Cellular Automata as Generators of Interleaving Sequences
An interleaving sequence is obtained by combining or intertwining elements from two or more sequences. On the other hand, cellular automata are known to be generators for keystream sequences. In this paper we present two families of one-dimensional cellular automata as generators of interleaving sequences. This study aims to close a notable gap within the current body of literature by exploring the capacity of cellular automata to generate interleaving sequences. While previous works have separ…

[2025-07-14 Mon (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

Characterizing and Testing Configuration Stability in Two-Dimensional Threshold Cellular Automata
Yonatan Nakar, Dana Ron
https://arxiv.org/abs/2507.14569 …

Characterizing and Testing Configuration Stability in Two-Dimensional Threshold Cellular Automata
We consider the problems of characterizing and testing the stability of cellular automata configurations that evolve on a two-dimensional torus according to threshold rules with respect to the von-Neumann neighborhood. While stable configurations for Threshold-1 (OR) and Threshold-5 (AND) are trivial (and hence easily testable), the other threshold rules exhibit much more diverse behaviors. We first characterize the structure of stable configurations with respect to the Threshold-2 (similarly, …

Irrational eigenvalues of D-Dimensional Cellular automata
Nassima Ait Sadi, Rezki Chemlal
https://arxiv.org/abs/2509.00933 https://arxiv.org/pdf/2509.00933…

Irrational eigenvalues of D-Dimensional Cellular automata
Cellular automata are dynamical systems defined on lattices and commuting with the Bernoulli shift. In this work, we focus on the spectral properties of D-dimensional cellular automata. We give a characterization of their spectrum from both topological and ergodic point of view. The main results of the paper show the impossibility for a cellular automaton with a fully blocking pattern to have a measurable irrational eigenvalues. Further more, a cellular automaton with a set of equicontinuity po…

Temporal Neural Cellular Automata: Application to modeling of contrast enhancement in breast MRI
Daniel M. Lang, Richard Osuala, Veronika Spieker, Karim Lekadir, Rickmer Braren, Julia A. Schnabel
https://arxiv.org/abs/2506.18720

Temporal Neural Cellular Automata: Application to modeling of contrast enhancement in breast MRI
Synthetic contrast enhancement offers fast image acquisition and eliminates the need for intravenous injection of contrast agent. This is particularly beneficial for breast imaging, where long acquisition times and high cost are significantly limiting the applicability of magnetic resonance imaging (MRI) as a widespread screening modality. Recent studies have demonstrated the feasibility of synthetic contrast generation. However, current state-of-the-art (SOTA) methods lack sufficient measures …

The Donsker-Varadhan Action Functional for Probabilistic Cellular Automata
Alex Eizenberg
https://arxiv.org/abs/2509.01745 https://arxiv.org/pdf/2509.01745…

The Donsker-Varadhan Action Functional for Probabilistic Cellular Automata
From the perspective of the large deviations theory of occupational measures, the paper considers Probabilistic Cellular Automata (PCA) as Markov chains on infinite dimensional space. It turns out that for a wide range of PCA, the corresponding Donsker-Varadhan action functional yields values other than infinity only on a narrow class of probability measures.

Reservoir Computing with Evolved Critical Neural Cellular Automata
Sidney Pontes-Filho, Stefano Nichele, Mikkel Lepper{\o}d
https://arxiv.org/abs/2508.02218 https://

Reservoir Computing with Evolved Critical Neural Cellular Automata
Criticality is a behavioral state in dynamical systems that is known to present the highest computation capabilities, i.e., information transmission, storage, and modification. Therefore, such systems are ideal candidates as a substrate for reservoir computing, a subfield in artificial intelligence. Our choice of a substrate is a cellular automaton (CA) governed by an artificial neural network, also known as neural cellular automaton (NCA). We apply evolution strategy to optimize the NCA to ach…

Post-apocalyptic computing from cellular automata
Genaro J. Martinez, Andrew Adamatzky, Guanrong Chen
https://arxiv.org/abs/2508.06035 https://arxiv.org/pd…

Post-apocalyptic computing from cellular automata
Cellular automata are arrays of finite state machines that can exist in a finite number of states. These machines update their states simultaneously based on specific local rules that govern their interactions. This framework provides a simple yet powerful model for studying complex systems and emergent behaviors. We revisit and reconsider the traditional notion of an algorithm, proposing a novel perspective in which algorithms are represented through the dynamic state-space configurations of c…

Exploring the Landscape of Non-Equilibrium Memories with Neural Cellular Automata
Ethan Lake, Ehsan Pajouheshgar
https://arxiv.org/abs/2508.15726 https://a…

Exploring the Landscape of Non-Equilibrium Memories with Neural Cellular Automata
We investigate the landscape of many-body memories: families of local non-equilibrium dynamics that retain information about their initial conditions for thermodynamically long time scales, even in the presence of arbitrary perturbations. In two dimensions, the only well-studied memory is Toom's rule. Using a combination of rigorous proofs and machine learning methods, we show that the landscape of 2D memories is in fact quite vast. We discover memories that correct errors in ways qualitatively…

Programmable Anyon Mobility through Higher Order Cellular Automata
Jie-Yu Zhang, Peng Ye
https://arxiv.org/abs/2508.13961 https://arxiv.org/pdf/2508.13961

Programmable Anyon Mobility through Higher Order Cellular Automata
Controlling anyon mobility is critical for robust quantum memory and understanding symmetry-enriched topological (SET) phases with subsystem symmetries (e.g., line-like, fractal, chaotic, or mixed supports). However, a unified framework for anyon mobility in SET phases with such diverse geometric patterns of symmetry supports has remained a major challenge. In this Letter, by introducing higher-order cellular automata (HOCA) -- a powerful computer science tool -- to SET physics, we establish a …

Rethinking Self-Replication: Detecting Distributed Selfhood in the Outlier Cellular Automaton
Arend Hintze, Clifford Bohm
https://arxiv.org/abs/2508.08047 https://

Rethinking Self-Replication: Detecting Distributed Selfhood in the Outlier Cellular Automaton
Spontaneous self-replication in cellular automata has long been considered rare, with most known examples requiring careful design or artificial initialization. In this paper, we present formal, causal evidence that such replication can emerge unassisted -- and that it can do so in a distributed, multi-component form. Building on prior work identifying complex dynamics in the Outlier rule, we introduce a data-driven framework that reconstructs the full causal ancestry of patterns in a determini…

A critical phase transition in bee movement dynamics can be modeled using a 2D cellular automata
Ivan Shpurov, Tom Froese
https://arxiv.org/abs/2507.11592 …

A critical phase transition in bee movement dynamics can be modeled using a 2D cellular automata
The collective behavior of numerous animal species, including insects, exhibits scale-free behavior indicative of the critical (second-order) phase transition. Previous research uncovered such phenomena in the behavior of honeybees, most notably the long-range correlations in space and time. Furthermore, it was demonstrated that the bee activity in the hive manifests the hallmarks of the jamming process. We follow up by presenting a discrete model of the system that faithfully replicates some o…

Using Dynamical Systems Theory to Quantify Complexity in Asymptotic Lenia
Ivan Yevenko, Hiroki Kojima, Chrystopher L. Nehaniv
https://arxiv.org/abs/2508.02935 https://

Using Dynamical Systems Theory to Quantify Complexity in Asymptotic Lenia
Continuous cellular automata (CCAs) have evolved from discrete lookup tables to continuous partial differential equation (PDE) formulations in the search for novel forms of complexity. Despite innovations in qualitative behavior, analytical methods have lagged behind, reinforcing the notion that emergent complexity defies simple explanation. In this paper, we demonstrate that the PDE formulation of Asymptotic Lenia enables rigorous analysis using dynamical systems theory. We apply the concepts …

A Cellular Automata Approach to Donation Game
Marcin Kowalik, Przemys{\l}aw Stok{\l}osa, Mateusz Grabowski, Janusz Starzyk, Pawe{\l} Raif
https://arxiv.org/abs/2507.11744

A Cellular Automata Approach to Donation Game
The donation game is a well-established framework for studying the emergence and evolution of cooperation in multi-agent systems. The cooperative behavior can be influenced by the environmental noise in partially observable settings and by the decision-making strategies of agents, which may incorporate not only reputation but also traits such as generosity and forgiveness. Traditional simulations often assume fully random interactions, where cooperation is tested between randomly selected agent…

Crosslisted article(s) found for cs.CV. https://arxiv.org/list/cs.CV/new
[2/2]:
- Exploring the Landscape of Non-Equilibrium Memories with Neural Cellular Automata
Ethan Lake, Ehsan Pajouheshgar

Replaced article(s) found for cs.CC. https://arxiv.org/list/cs.CC/new
[1/1]:
- Fast Simulation of Cellular Automata by Self-Composition
Joseph Natal, Oleksiy Al-saadi

Neural Cellular Automata for ARC-AGI
Kevin Xu, Risto Miikkulainen
https://arxiv.org/abs/2506.15746 https://arxiv.org/pdf/2506.15746…

Neural Cellular Automata for ARC-AGI
Cellular automata and their differentiable counterparts, Neural Cellular Automata (NCA), are highly expressive and capable of surprisingly complex behaviors. This paper explores how NCAs perform when applied to tasks requiring precise transformations and few-shot generalization, using the Abstraction and Reasoning Corpus for Artificial General Intelligence (ARC-AGI) as a domain that challenges their capabilities in ways not previously explored. Specifically, this paper uses gradient-based train…

[2025-08-13 Wed (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

Bayesian Inversion via Probabilistic Cellular Automata: an application to image denoising
Danilo Costarelli, Michele Piconi, Alessio Troiani
https://arxiv.org/abs/2507.14869 htt…

Bayesian Inversion via Probabilistic Cellular Automata: an application to image denoising
We propose using Probabilistic Cellular Automata (PCA) to address inverse problems with the Bayesian approach. In particular, we use PCA to sample from an approximation of the posterior distribution. The peculiar feature of PCA is their intrinsic parallel nature, which allows for a straightforward parallel implementation that allows the exploitation of parallel computing architecture in a natural and efficient manner. We compare the performance of the PCA method with the standard Gibbs sampler …

A perturbed cellular automaton with two phase transitions for the ergodicity
Hugo Marsan, Mathieu Sablik, Ilkka T\"orm\"a
https://arxiv.org/abs/2507.03485 https://

Replaced article(s) found for nlin.CG. https://arxiv.org/list/nlin.CG/new
[1/1]:
- Fast offline decoding with local message-passing automata
Ethan Lake
https://…

[2025-08-12 Tue (UTC), 1 new article found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-09-12 Fri (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

Replaced article(s) found for nlin.CG. https://arxiv.org/list/nlin.CG/new
[1/1]:
- Essential metrics for Life on graphs
Michiel Rollier, Lucas Caldeira de Oliveira, Odemir M. Bruno, Jan M. Baetens

[2025-08-11 Mon (UTC), 1 new article found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-09-11 Thu (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-07-11 Fri (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-09-10 Wed (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-07-10 Thu (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

Replaced article(s) found for cs.NE. https://arxiv.org/list/cs.NE/new
[1/1]:
- Neural Cellular Automata for ARC-AGI
Kevin Xu, Risto Miikkulainen
https://

[2025-09-09 Tue (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

Replaced article(s) found for nlin.CG. https://arxiv.org/list/nlin.CG/new
[1/1]:
- A More Convex Ising Formulation of Max-3-Cut Using Higher-Order Spin Interactions
Robbe De Prins, Guy Van der Sande, Peter Bienstman, Thomas Van Vaerenbergh

[2025-07-09 Wed (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-09-08 Mon (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-08-08 Fri (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

Crosslisted article(s) found for nlin.CG. https://arxiv.org/list/nlin.CG/new
[1/1]:
- Dominant vertices and attractors' landscape for Boolean networks
Andrea Espa\~na, William Funez, Edgardo Ugalde

[2025-07-08 Tue (UTC), 1 new article found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-08-07 Thu (UTC), 1 new article found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

Crosslisted article(s) found for nlin.CG. https://arxiv.org/list/nlin.CG/new
[1/1]:
- BoolForge: Random Generation and Analysis of Boolean Functions and Networks in Python
Claus Kadelka, Benjamin Coberly

[2025-07-07 Mon (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-08-06 Wed (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-09-05 Fri (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-08-05 Tue (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

Crosslisted article(s) found for nlin.CG. https://arxiv.org/list/nlin.CG/new
[1/1]:
- Traffic State Estimation in Congestion to Extend Applicability of DFOS
Yoshiyuki Yajima, Hemant Prasad, Daisuke Ikefuji, Hitoshi Sakurai, Manabu Otani

Replaced article(s) found for nlin.CG. https://arxiv.org/list/nlin.CG/new
[1/1]:
- Generating 3D Terrain with 2D Cellular Automata
Nuno Fachada, Ant\'onio R. Rodrigues, Diogo de Andrade, Phil Lopes

Crosslisted article(s) found for nlin.CG. https://arxiv.org/list/nlin.CG/new
[1/1]:
- Exploring the Landscape of Non-Equilibrium Memories with Neural Cellular Automata
Ethan Lake, Ehsan Pajouheshgar

[2025-09-04 Thu (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-09-03 Wed (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-07-04 Fri (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-09-02 Tue (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-07-03 Thu (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-08-01 Fri (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-09-01 Mon (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

Essential metrics for Life on graphs
Michiel Rollier, Lucas Caldeira de Oliveira, Odemir M. Bruno, Jan M. Baetens
https://arxiv.org/abs/2506.21226 https://…

Essential metrics for Life on graphs
We present a strong theoretical foundation that frames a well-defined family of outer-totalistic network automaton models as a topological generalisation of binary outer-totalistic cellular automata, of which the Game of Life is one notable particular case. These "Life-like network automata" are quantitatively described by expressing their genotype (the mean field curve and Derrida curve) and phenotype (the evolution of the state and defect averages). After demonstrating that the genotype and p…

[2025-07-31 Thu (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-07-01 Tue (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

Replaced article(s) found for nlin.CG. https://arxiv.org/list/nlin.CG/new
[1/1]:
- Fast offline decoding with local message-passing automata
Ethan Lake

[2025-07-30 Wed (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-06-30 Mon (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-07-29 Tue (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-08-29 Fri (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

Replaced article(s) found for nlin.CG. https://arxiv.org/list/nlin.CG/new
[1/1]:
- The maximum distinctness of physical systems
Norman Margolus
https://

[2025-08-28 Thu (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-08-27 Wed (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-06-27 Fri (UTC), 1 new article found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-07-28 Mon (UTC), 1 new article found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-08-26 Tue (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

Replaced article(s) found for nlin.CG. https://arxiv.org/list/nlin.CG/new
[1/1]:
- Deterministic many-body dynamics with multifractal response
Yusuf Kasim, Toma\v{z} Prosen

[2025-08-25 Mon (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-06-26 Thu (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

Replaced article(s) found for nlin.CG. https://arxiv.org/list/nlin.CG/new
[1/1]:
Finding ground states of a square Newman-Moore lattice with sides equal to a Mersenne number usin...

[2025-06-25 Wed (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-06-24 Tue (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-07-25 Fri (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-08-22 Fri (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-06-23 Mon (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-07-24 Thu (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-08-21 Thu (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-07-23 Wed (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-08-20 Wed (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-07-22 Tue (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-08-19 Tue (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-06-20 Fri (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot

[2025-07-21 Mon (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot