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

{"title":"Universal fragmentation in annihilation reactions with constrained kinetics","authors":"Enrique Rozas Garcia, Alfred Weddig Karlsson, Johannes Hofmann","doi":"arxiv-2404.16950","DOIUrl":"https://doi.org/arxiv-2404.16950","url":null,"abstract":"In reaction-diffusion models of annihilation reactions in low dimensions,\u0000single-particle dynamics provides a bottleneck for reactions, leading to an\u0000anomalously slow approach to the empty state. Here, we construct a reaction\u0000model with a reciprocal bottleneck on particle dynamics where single-particle\u0000motion conserves the center of mass. We show that such a constrained\u0000reaction-diffusion dynamics does not approach an empty state but freezes at\u0000late times in a state with fragmented particle clusters, and that the late-time\u0000dynamics and asymptotic density are universal. Our setup thus constitutes a\u0000minimal model for the fragmentation of a one-dimensional lattice into\u0000independent particle clusters, and we provide exact results for the final\u0000density in the large-reaction rate limit. We suggest that the universal\u0000reaction dynamics could be observable in experiments with cold atoms or in the\u0000Auger recombination of exciton gases.","PeriodicalId":501231,"journal":{"name":"arXiv - PHYS - Cellular Automata and Lattice Gases","volume":"112 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140811780","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}

{"title":"A Dynamic Model of Integration","authors":"Joseph D. Johnson, Marisa C. Eisenberg","doi":"arxiv-2403.02122","DOIUrl":"https://doi.org/arxiv-2403.02122","url":null,"abstract":"Thomas Schelling introduced his agent-based model of segregation in 1971 and\u0000concluded that even when there is a low amount of intolerance within society\u0000that segregation will develop if people follow their individual preferences. A\u0000large body of literature building of this framework has been built and has\u0000bolstered this claim. This paper aims to take the same framework but instead\u0000look for ways to get to an integrated state. We focus on Allport's contact\u0000hypothesis that states that if there is equal status among groups, common goals\u0000among groups, and an institutional mechanism supporting intergroup contact then\u0000intergroup contact can reduce prejudice. We incorporate the contact hypothesis\u0000by having individuals adjust their intolerance based on their current\u0000neighborhood composition and the ease of conforming to their surroundings.\u0000Furthermore, we add in positive and negative media effects, as individuals are\u0000likely to get information about an outgroup from the media (e.g., news, TV,\u0000movies, etc.) that they consume. We find that having a society composed of\u0000individuals who do not easily conform to their surroundings and displaying\u0000positive examples of both groups in media promote integration within society.","PeriodicalId":501231,"journal":{"name":"arXiv - PHYS - Cellular Automata and Lattice Gases","volume":"22 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140037230","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}

{"title":"The Computation for Reversibility of Arbitrary One-dimensional Finite Cellular Automata Becomes Efficient","authors":"Chen Wang, Junchi Ma, Chao Wang, Defu Lin, Weilin Chen","doi":"arxiv-2402.05404","DOIUrl":"https://doi.org/arxiv-2402.05404","url":null,"abstract":"In this paper, we completely solve the reversibility of one-dimensional\u0000finite cellular automata (FCA). This means that we will have an efficient\u0000method to determine the reversibility of any FCA with all numbers (n) of cells.\u0000The complexity of this algorithm is independent of n. We perform calculations\u0000on two new kinds of graphs and discover that the reversibility of any FCA\u0000exhibits periodicity as n increases. We successfully provide a method to\u0000compute the reversibility sequence that encompasses the reversibility of FCA\u0000with any number of cells. Additionally, the calculations in this paper are\u0000applicable to FCA with various types of boundaries.","PeriodicalId":501231,"journal":{"name":"arXiv - PHYS - Cellular Automata and Lattice Gases","volume":"108 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139757346","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}

{"title":"A Comprehensive Taxonomy of Cellular Automata","authors":"Michiel Rollier, Kallil M. C. Zielinski, Aisling J. Daly, Odemir M. Bruno, Jan M. Baetens","doi":"arxiv-2401.08408","DOIUrl":"https://doi.org/arxiv-2401.08408","url":null,"abstract":"Cellular automata (CAs) are fully-discrete dynamical models that have\u0000received much attention due to the fact that their relatively simple setup can\u0000nonetheless express highly complex phenomena. Despite the model's theoretical\u0000maturity and abundant computational power, the current lack of a complete\u0000survey on the 'taxonomy' of various families of CAs impedes efficient and\u0000interdisciplinary progress. This review paper mitigates that deficiency; it\u0000provides a methodical overview of five important CA 'families': asynchronous,\u0000stochastic, multi-state, extended-neighbourhood, and non-uniform CAs. These\u0000five CA families are subsequently presented from four angles. First, a rigorous\u0000mathematical definition is given. Second, we map prominent variations within\u0000each CA family, as such highlighting mathematical equivalences with types from\u0000other families. Third, we discuss the genotype and phenotype of these CA types\u0000by means of mathematical tools, indicating when established tools break down.\u0000Fourth, we conclude each section with a brief overview of applications related\u0000to information theory and mathematical modelling.","PeriodicalId":501231,"journal":{"name":"arXiv - PHYS - Cellular Automata and Lattice Gases","volume":"55 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139484151","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}

{"title":"Simulated Autopoiesis in Liquid Automata","authors":"Steve Battle","doi":"arxiv-2401.07969","DOIUrl":"https://doi.org/arxiv-2401.07969","url":null,"abstract":"We present a novel form of Liquid Automata, using this to simulate\u0000autopoiesis, whereby living machines self-organise in the physical realm. This\u0000simulation is based on an earlier Cellular Automaton described by Francisco\u0000Varela. The basis of Liquid Automata is a particle simulation with additional\u0000rules about how particles are transformed on collision with other particles.\u0000Unlike cellular automata, there is no fixed grid or time-step, only particles\u0000moving about and colliding with each other in a continuous space/time.","PeriodicalId":501231,"journal":{"name":"arXiv - PHYS - Cellular Automata and Lattice Gases","volume":"11 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139482529","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}

{"title":"Binding potential and wetting behaviour of binary liquid mixtures on surfaces","authors":"Mounirah Areshi, Dmitri Tseluiko, Uwe Thiele, Benjamin D. Goddard, Andrew J. Archer","doi":"arxiv-2401.04641","DOIUrl":"https://doi.org/arxiv-2401.04641","url":null,"abstract":"We present a theory for the interfacial wetting phase behaviour of binary\u0000liquid mixtures on rigid solid substrates, applicable to both miscible and\u0000immiscible mixtures. In particular, we calculate the binding potential as a\u0000function of the adsorptions, i.e. the excess amounts of each of the two liquids\u0000at the substrate. The binding potential fully describes the corresponding\u0000interfacial thermodynamics. Our approach is based on classical density\u0000functional theory. Binary liquid mixtures can exhibit complex bulk phase\u0000behaviour, including both liquid-liquid and vapour-liquid phase separation,\u0000depending on the nature of the interactions between all the particles of the\u0000two different liquids, the temperature and the chemical potentials. Here we\u0000show that the interplay between the bulk phase behaviour of the mixture and the\u0000properties of the interactions with the substrate gives rise to a wide variety\u0000of interfacial phase behaviours, including mixing and demixing situations. We\u0000find situations where the final state is a coexistence of up to three different\u0000phases. We determine how the liquid density profiles close to the substrate\u0000change as the interaction parameters are varied and how these determine the\u0000form of the binding potential, which in certain cases can be a multi-valued\u0000function of the adsorptions. We also present profiles for sessile droplets of\u0000both miscible and immiscible binary liquids.","PeriodicalId":501231,"journal":{"name":"arXiv - PHYS - Cellular Automata and Lattice Gases","volume":"5 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139409123","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}

{"title":"Four state deterministic cellular automaton rule emulating random diffusion","authors":"Henryk Fukś","doi":"arxiv-2312.11377","DOIUrl":"https://doi.org/arxiv-2312.11377","url":null,"abstract":"We show how to construct a deterministic nearest-neighbour cellular automaton\u0000(CA) with four states which emulates diffusion on a one-dimensional lattice.\u0000The pseudo-random numbers needed for directing random walkers in the diffusion\u0000process are generated with the help of rule 30. This CA produces density\u0000profiles which agree very well with solutions of the diffusion equation, and we\u0000discuss this agreement for two different boundary and initial conditions. We\u0000also show how our construction can be generalized to higher dimensions.","PeriodicalId":501231,"journal":{"name":"arXiv - PHYS - Cellular Automata and Lattice Gases","volume":"34 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138742336","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}

{"title":"Memory-based involution dilemma on square lattices","authors":"Chaochao Huang, Chaoqian Wang","doi":"arxiv-2312.06912","DOIUrl":"https://doi.org/arxiv-2312.06912","url":null,"abstract":"When involution affects individuals, their efforts do not augment resources\u0000but merely compete for limited resources. From entrance exams to company\u0000overtime, such efforts lead to unnecessary costs, undermining group welfare.\u0000Meanwhile, the individual advantages or collective disadvantages from this\u0000unnecessary effort may accumulate over time, such as the long-term validity of\u0000test scores. To identify the role of this memory factor, we propose a\u0000memory-based involution game model. In a more competitive environment, our\u0000findings suggest: (i) with scant social resources, increasing memory length\u0000curbs involution, (ii) with moderate resources, increasing memory length\u0000initially intensifies involution but later reduces it, and (iii) with abundant\u0000social resources, increasing memory length amplifies involution. Conversely, in\u0000a less competitive environment, involution consistently decreases with a larger\u0000memory length. Our research provides insights into mitigating involution by\u0000considering memory effects.","PeriodicalId":501231,"journal":{"name":"arXiv - PHYS - Cellular Automata and Lattice Gases","volume":"4 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138632406","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}

{"title":"Meta-Diversity Search in Complex Systems, A Recipe for Artificial Open-Endedness ?","authors":"Mayalen EtcheverryFlowers, Bert Wang-Chak ChanFlowers, Clément Moulin-FrierFlowers, Pierre-Yves OudeyerFlowers","doi":"arxiv-2312.00455","DOIUrl":"https://doi.org/arxiv-2312.00455","url":null,"abstract":"Can we build an artificial system that would be able to generate endless\u0000surprises if ran \"forever\" in Minecraft? While there is not a single path\u0000toward solving that grand challenge, this article presents what we believe to\u0000be some working ingredients for the endless generation of novel increasingly\u0000complex artifacts in Minecraft. Our framework for an open-ended system includes\u0000two components: a complex system used to recursively grow and complexify\u0000artifacts over time, and a discovery algorithm that leverages the concept of\u0000meta-diversity search. Since complex systems have shown to enable the emergence\u0000of considerable complexity from set of simple rules, we believe them to be\u0000great candidates to generate all sort of artifacts in Minecraft. Yet, the space\u0000of possible artifacts that can be generated by these systems is often unknown,\u0000challenging to characterize and explore. Therefore automating the long-term\u0000discovery of novel and increasingly complex artifacts in these systems is an\u0000exciting research field. To approach these challenges, we formulate the problem\u0000of meta-diversity search where an artificial \"discovery assistant\"\u0000incrementally learns a diverse set of representations to characterize behaviors\u0000and searches to discover diverse patterns within each of them. A successful\u0000discovery assistant should continuously seek for novel sources of diversities\u0000while being able to quickly specialize the search toward a new unknown type of\u0000diversity. To implement those ideas in the Minecraft environment, we simulate\u0000an artificial \"chemistry\" system based on Lenia continuous cellular automaton\u0000for generating artifacts, as well as an artificial \"discovery assistant\"\u0000(called Holmes) for the artifact-discovery process. Holmes incrementally learns\u0000a hierarchy of modular representations to characterize divergent sources of\u0000diversity and uses a goal-based intrinsically-motivated exploration as the\u0000diversity search strategy.","PeriodicalId":501231,"journal":{"name":"arXiv - PHYS - Cellular Automata and Lattice Gases","volume":"218 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138532863","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}

{"title":"Autoencoder-assisted study of directed percolation with spatial long-range interactions","authors":"Yanyang Wang, Yuxiang Yang, Wei Li","doi":"arxiv-2311.12426","DOIUrl":"https://doi.org/arxiv-2311.12426","url":null,"abstract":"Spatial L{'{e}}vy-like flights are introduced as a way to absorbing phase\u0000transitions to produce non-local interactions. We utilize the autoencoder, an\u0000unsupervised learning method, to predict the critical points for $(1+1)$-d\u0000directed percolation with such spatial long-range interactions. After making a\u0000global coverage of the reaction-diffusion distance and taking a series of\u0000different values for the parameter ;${beta}$; in the distribution\u0000;$P(r){sim}1/r^{beta}$;, the critical points $P_c$ that can be continuously\u0000varied are obtained. And the dynamic decay of the particle density under the\u0000critical points was counted as a way to determine the critical exponent\u0000;${delta}$; of the survival rate. We also investigate the active behavior of\u0000the system's particles under the critical point with increasing time steps,\u0000which allows us to determine the characteristic time $t_f$ of the finite-scale\u0000systems. And the dynamic exponents ;$z$; are obtained using the scaling\u0000relation ;$t_f{sim}L^{z}$;. We find that the autoencoder can well identify\u0000this characteristic evolutionary behavior of particles. Finally, we discuss the\u0000compliance of the scaling form ;$1/{delta}-({beta}-2)/{delta}z=2$; in\u0000different ;${beta}$; intervals as well as a method to introduce a global\u0000scaling mechanism by generating a random walking step using the L{'{e}}vy\u0000distribution.","PeriodicalId":501231,"journal":{"name":"arXiv - PHYS - Cellular Automata and Lattice Gases","volume":"52 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138532862","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}