arXiv - PHYS - Cellular Automata and Lattice Gases最新文献

Networks of Binary Necklaces Induced by Elementary Cellular Automata Rules 由基本细胞自动机规则诱导的二进制项链网络

arXiv - PHYS - Cellular Automata and Lattice Gases Pub Date : 2024-09-07 DOI: arxiv-2409.04780

Lapo Frati, Csenge Petak, Nick Cheney

引用次数: 0

Efficient Simulation of Non-uniform Cellular Automata with a Convolutional Neural Network 用卷积神经网络高效模拟非均匀蜂窝自动机

arXiv - PHYS - Cellular Automata and Lattice Gases Pub Date : 2024-09-04 DOI: arxiv-2409.02722

Michiel Rollier, Aisling J. Daly, Odemir M. Bruno, Jan M. Baetens

引用次数: 0

Convolutional Neural Networks for Automated Cellular Automaton Classification 用于细胞自动机自动分类的卷积神经网络

arXiv - PHYS - Cellular Automata and Lattice Gases Pub Date : 2024-09-04 DOI: arxiv-2409.02740

Michiel Rollier, Aisling J. Daly, Jan M. Baetens

{"title":"Convolutional Neural Networks for Automated Cellular Automaton Classification","authors":"Michiel Rollier, Aisling J. Daly, Jan M. Baetens","doi":"arxiv-2409.02740","DOIUrl":"https://doi.org/arxiv-2409.02740","url":null,"abstract":"The emergent dynamics in spacetime diagrams of cellular automata (CAs) is\u0000often organised by means of a number of behavioural classes. Whilst\u0000classification of elementary CAs is feasible and well-studied, non-elementary\u0000CAs are generally too diverse and numerous to exhaustively classify manually.\u0000In this chapter we treat the spacetime diagram as a digital image, and\u0000implement simple computer vision techniques to perform an automated\u0000classification of elementary cellular automata into the five Li-Packard\u0000classes. In particular, we present a supervised learning task to a\u0000convolutional neural network, in such a way that it may be generalised to\u0000non-elementary CAs. If we want to do so, we must divert the algorithm's focus\u0000away from the underlying 'microscopic' local updates. We first show that\u0000previously developed deep learning approaches have in fact been trained to\u0000identify the local update rule, rather than directly focus on the mesoscopic\u0000patterns that are associated with the particular behavioural classes. By means\u0000of a well-argued neural network design, as well as a number of data\u0000augmentation techniques, we then present a convolutional neural network that\u0000performs nearly perfectly at identifying the behavioural class, without\u0000necessarily first identifying the underlying microscopic dynamics.","PeriodicalId":501231,"journal":{"name":"arXiv - PHYS - Cellular Automata and Lattice Gases","volume":"68 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142184621","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Block approximations for probabilistic mixtures of elementary cellular automata 基本细胞自动机概率混合物的块近似值

arXiv - PHYS - Cellular Automata and Lattice Gases Pub Date : 2024-08-17 DOI: arxiv-2408.09201

E. N. M. Cirillo, G. Lancia, C. Spitoni

引用次数: 0

Complete ergodicity in one-dimensional reversible cellar automata 一维可逆窖藏自动机的完全遍历性

arXiv - PHYS - Cellular Automata and Lattice Gases Pub Date : 2024-08-13 DOI: arxiv-2408.06691

Naoto Shiraishi, Shinji Takesue

引用次数: 0

Rule 60 cellular automaton, Mersenne numbers, and the Newman-Moore spin lattice 规则 60 细胞自动机、梅森数和纽曼-摩尔自旋网格

arXiv - PHYS - Cellular Automata and Lattice Gases Pub Date : 2024-07-29 DOI: arxiv-2407.19898

Jonás Carmona-Pírez, Adrian J. Peguero, Vanja Dunjko, Maxim Olshanii, Joanna Ruhl

引用次数: 0

A Sensitivity Analysis of Cellular Automata and Heterogeneous Topology Networks: Partially-Local Cellular Automata and Homogeneous Homogeneous Random Boolean Networks 蜂窝自动机和异构拓扑网络的敏感性分析：部分局部蜂窝自动机与同构随机布尔网络

arXiv - PHYS - Cellular Automata and Lattice Gases Pub Date : 2024-07-25 DOI: arxiv-2407.18017

Tom Eivind Glover, Ruben Jahren, Francesco Martinuzzi, Pedro Gonçalves Lind, Stefano Nichele

{"title":"A Sensitivity Analysis of Cellular Automata and Heterogeneous Topology Networks: Partially-Local Cellular Automata and Homogeneous Homogeneous Random Boolean Networks","authors":"Tom Eivind Glover, Ruben Jahren, Francesco Martinuzzi, Pedro Gonçalves Lind, Stefano Nichele","doi":"arxiv-2407.18017","DOIUrl":"https://doi.org/arxiv-2407.18017","url":null,"abstract":"Elementary Cellular Automata (ECA) are a well-studied computational universe\u0000that is, despite its simple configurations, capable of impressive computational\u0000variety. Harvesting this computation in a useful way has historically shown\u0000itself to be difficult, but if combined with reservoir computing (RC), this\u0000becomes much more feasible. Furthermore, RC and ECA enable energy-efficient AI,\u0000making the combination a promising concept for Edge AI. In this work, we\u0000contrast ECA to substrates of Partially-Local CA (PLCA) and Homogeneous\u0000Homogeneous Random Boolean Networks (HHRBN). They are, in comparison, the\u0000topological heterogeneous counterparts of ECA. This represents a step from ECA\u0000towards more biological-plausible substrates. We analyse these substrates by\u0000testing on an RC benchmark (5-bit memory), using Temporal Derrida plots to\u0000estimate the sensitivity and assess the defect collapse rate. We find that,\u0000counterintuitively, disordered topology does not necessarily mean disordered\u0000computation. There are countering computational \"forces\" of topology\u0000imperfections leading to a higher collapse rate (order) and yet, if accounted\u0000for, an increased sensitivity to the initial condition. These observations\u0000together suggest a shrinking critical range.","PeriodicalId":501231,"journal":{"name":"arXiv - PHYS - Cellular Automata and Lattice Gases","volume":"18 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141772761","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Intrinsic Universality in Seeded Active Tile Self-Assembly 种子活性瓦片自组装的内在普遍性

arXiv - PHYS - Cellular Automata and Lattice Gases Pub Date : 2024-07-16 DOI: arxiv-2407.11545

Tim Gomez, Elise Grizzell, Asher Haun, Ryan Knobel, Tom Peters, Robert Schweller, Tim Wylie

{"title":"Intrinsic Universality in Seeded Active Tile Self-Assembly","authors":"Tim Gomez, Elise Grizzell, Asher Haun, Ryan Knobel, Tom Peters, Robert Schweller, Tim Wylie","doi":"arxiv-2407.11545","DOIUrl":"https://doi.org/arxiv-2407.11545","url":null,"abstract":"The Tile Automata (TA) model describes self-assembly systems in which\u0000monomers can build structures and transition with an adjacent monomer to change\u0000their states. This paper shows that seeded TA is a non-committal intrinsically\u0000universal model of self-assembly. We present a single universal Tile Automata\u0000system containing approximately 4600 states that can simulate (a) the output\u0000assemblies created by any other Tile Automata system G, (b) the dynamics\u0000involved in building G's assemblies, and (c) G's internal state transitions. It\u0000does so in a non-committal way: it preserves the full non-deterministic\u0000dynamics of a tile's potential attachment or transition by selecting its state\u0000in a single step, considering all possible outcomes until the moment of\u0000selection. The system uses supertiles, each encoding the complete system being\u0000simulated. The universal system builds supertiles from its seed, each\u0000representing a single tile in G, transferring the information to simulate G to\u0000each new tile. Supertiles may also asynchronously transition states according\u0000to the rules of G. This result directly transfers to a restricted version of\u0000asynchronous Cellular Automata: pairwise Cellular Automata.","PeriodicalId":501231,"journal":{"name":"arXiv - PHYS - Cellular Automata and Lattice Gases","volume":"75 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141721273","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Unveiling the Dynamics of Employee Behavior Through Wolframs Cellular Automata 通过 Wolframs 细胞自动机揭示员工行为的动态变化

arXiv - PHYS - Cellular Automata and Lattice Gases Pub Date : 2024-07-12 DOI: arxiv-2407.09581

Rakshitha Jayashankar, Mahesh Balan

引用次数: 0

Classification of Cellular Automata based on the Hamming distance 基于汉明距离的细胞自动机分类

arXiv - PHYS - Cellular Automata and Lattice Gases Pub Date : 2024-07-08 DOI: arxiv-2407.06175

Gaspar Alfaro, Miguel A. F. Sanjuán

引用次数: 0