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 487 records · Page 27Linked to original sources

Supervised and unsupervised learning of (1+1)-dimensional even-offspring branching annihilating random walks

Machine learning (ML) of phase transitions (PTs) has gradually become an effective approach that enables us to explore the nature of various PTs more promptly in equilibrium and nonequilibrium systems. Unlike equilibrium systems, non-equilibrium systems display more complicated and diverse features because of the extra dimension of time, which is not readily tractable, both theoretically and numerically. The combination of ML and most renowned nonequilibrium model, directed percolation (DP), led to some significant findings. In this study, ML is applied to (1+1)-d, even offspring branching annihilating random walks (BAW), whose universality class is not DP-like. The supervised learning of (1+1)-d BAW via convolutional neural networks (CNN) results in a more accurate prediction of the critical point than the Monte Carlo (MC) simulation for the same system sizes. The dynamic exponent \;$z$\; and spatial correlation length correlation exponent \;$ν_{\perp}$\ were also measured and found to be consistent with their respective theoretical values. Furthermore, the unsupervised learning of (1+1)-d BAW via an autoencoder (AE) gives rise to a transition point, which is the same as the critical point. The latent layer of AE, through a single neuron, can be regarded as the order parameter of the system being properly re-scaled. Therefore, we believe that ML has exciting application prospects in reaction-diffusion systems such as BAW and DP.

nlin.CG↗

Simulating the spread of COVID-19 with cellular automata: A new approach

Between the years 2020 to 2022, the world was hit by the pandemic of COVID-19 giving rise to an extremely grave situation. The global economy was badly hurt due to the consequences of various intervention strategies (like social distancing, lockdown) which were applied by different countries to control this pandemic. There are multiple speculations that humanity will again face such pandemics in the future. Thus it is very important to learn and gain knowledge about the spread of such infectious diseases and the various factors which are responsible for it. In this study, we have extended our previous work (Chowdhury et.al., 2022) on the probabilistic cellular automata (CA) model to reproduce the spread of COVID-19 in several countries by modifying its earlier used neighbourhood criteria. This modification gives us the liberty to adopt the effect of different restrictions like lockdown and social distancing in our model. We have done some theoretical analysis for initial infection and simulations to gain insights into our model. We have also studied the data from eight countries for COVID-19 in a window of 876 days and compared it with our model. We have developed a proper framework to fit our model on the data for confirmed cases of COVID-19 and have also re-checked the goodness of the fit with the data of the deceased cases for this pandemic. This model fits well with different peaks of COVID-19 data for all the eight countries and can be possibly generalized for a global prediction.

physics.soc-ph↗

An Invitation to Number-Conserving Cellular Automata

Number-conserving cellular automata are discrete dynamical systems that simulate interacting particles like e.g. grains of sand. In an earlier paper, I had already derived a uniform construction for all transition rules of one-dimensional number-conserving automata. Here I describe in greater detail how one can simulate the automata on a computer and how to find interesting rules. I show several rules that I have found this way and also some theorems about the space of number-conserving automata.

nlin.CG↗

Layered Cellular Automata

Layered Cellular Automata (LCA) extends the concept of traditional cellular automata (CA) to model complex systems and phenomena. In LCA, each cell's next state is determined by the interaction of two layers of computation, allowing for more dynamic and realistic simulations. This thesis explores the design, dynamics, and applications of LCA, with a focus on its potential in pattern recognition and classification. The research begins by introducing the limitations of traditional CA in capturing the complexity of real-world systems. It then presents the concept of LCA, where layer 0 corresponds to a predefined model, and layer 1 represents the proposed model with additional influence. The interlayer rules, denoted as f and g, enable interactions not only from adjacent neighboring cells but also from some far-away neighboring cells, capturing long-range dependencies. The thesis explores various LCA models, including those based on averaging, maximization, minimization, and modified ECA neighborhoods. Additionally, the implementation of LCA on the 2-D cellular automaton Game of Life is discussed, showcasing intriguing patterns and behaviors. Through extensive experiments, the dynamics of different LCA models are analyzed, revealing their sensitivity to rule changes and block size variations. Convergent LCAs, which converge to fixed points from any initial configuration, are identified and used to design a two-class pattern classifier. Comparative evaluations demonstrate the competitive performance of the LCA-based classifier against existing algorithms. Theoretical analysis of LCA properties contributes to a deeper understanding of its computational capabilities and behaviors. The research also suggests potential future directions, such as exploring advanced LCA models, higher-dimensional simulations, and hybrid approaches integrating LCA with other computational models.

nlin.CG↗

Global Optimization-Based Calibration Algorithm for a 2D Distributed Hydrologic-Hydrodynamic and Water Quality Model

Hydrodynamic models with rain-on-the-grid capabilities are usually computationally expensive. This makes the use of automatic calibration algorithms hard to apply due to the large number of model runs. However, with the recent advances in parallel processing, computational resources, and increasing high-resolution climatologic and GIS data, high-resolution hydrodynamic models can be used for optimization-based calibration. This paper presents a global optimization-based algorithm to calibrate a fully distributed hydrologic-hydrodynamic and water quality model (HydroPol2D) using observed data (i.e., discharge, or pollutant concentration) as input. The algorithm can find a near-optimal set of parameters to explain observed gauged data. The modeling framework presented here, although applied in a poorly-gauged catchment, can be adapted for catchments with more detailed observations. We applied the algorithm in different cases of the V-Tilted Catchment, the Wooden-Board catchment, and in an existing urban catchment with heterogeneous data. The results of automatic calibration indicate $\mathrm{NSE} = 0.99$ for the V-Tilted catchment, $\mathrm{RMSE} = 830~\mathrm{mgL^{-1}}$ for salt concentration pollutographs (i.e., 8.3% of the event mean concentration), and $\mathrm{NSE} = 0.89$ for the urban catchment case study. This paper also explores the issue of equifinality in modeling calibration (EqMC). Equifinality is defined as the set of different parameter combinations that can provide equally good or accepted results, within the physical parameter ranges. EqMC decreases with the number of events and increases with the choice of partially or nonproducing runoff ones. Furthermore, results indicate that providing more accurate parameter ranges based on a priori knowledge of the catchment is fundamental to reduce the chances of finding a set of parameters with equifinality.

physics.geo-ph↗

From Flow to Jamming: Lattice Gas Automaton Simulations in Granular Materials

We introduce the first extension of a Lattice Gas Automaton (LGA) model to accurately replicate observed emergent phenomena in granular materials with a special focus on previously unexplored jamming transitions by incorporating gravitational effects, energy dissipation in particle collisions, and wall friction. We successfully reproduce flow rate evolution, density wave formation, and jamming transition observed in experiments. We also explore the critical density at which jamming becomes probable. This research advances our understanding of granular dynamics and offers insights into the jamming behavior of granular materials.

cond-mat.soft↗

Trigonometric Plot of Ising Model

A novel cellular automaton with update rules reversed with the environment depending on the cell, is frustrated through its von Neumann and Moore neighborhoods and evolved anisotropically. Addition of fine tuning and coupling plots the susceptibility of an Ising model that has five phase transitions, both first-order and second-order, and four magnetic phases. This susceptibility model generates a trigonometric plot as an output of the cell evolution, without the use of math libraries or primitives.

nlin.CG↗

Patterns Induce Injectivity: A New Thinking in Constructing Injective Local Rules of 1D Cellular Automata over $\mathbb{F}_2$

We discovered that certain patterns called injective patterns remain stable during the revolution process, allowing us to create many reversible CA simply by using them to design the revolution rules. By examining injective patterns, we investigated their structural stability during revolutions. This led us to discover extended patterns and pattern mixtures that can create more reversible cellular automata. Furthermore, our research proposed a new way to study the reversibility of CA by observing the structure of local rule $f$. In this paper, we will explicate our study and propose an efficient method for finding the injective patterns. Our algorithms can find injective rules and generate local rule $f$ by traversing $2^{N}$, instead of $2^{2^{N}}$ to check all injective rules and pick the injective ones.

cs.CC↗

Metastability due to a branching-merging structure in a simple network of an exclusion process

We investigate a simple network, which has a branching-merging structure, using the totally asymmetric simple exclusion process, considering conflicts at the merging point. For both periodic and open boundary conditions, the system exhibits metastability. Specifically, for open boundary conditions, we observe two types of metastability: hysteresis and a nonergodic phase. We analytically determine the tipping points, that is, the critical conditions under which a small disturbance can lead to the collapse of metastability. Our findings provide novel insights into metastability induced by branching-merging structures, which exist in all network systems in various fields.

cond-mat.stat-mech↗

Macroscopic Manifestations of Traffic Waves in Microscopic Models

Traffic waves can rise even from single lane car-following behaviour. To better understand and mitigate traffic waves, it is necessary to use analytical tools like mathematical models, data analysis, and micro-simulations that can capture the dynamics of real traffic flow. In this study, we isolate car-following dynamics and present a systematic hierarchy of tests that connect the microscopic scale with the meaningful macroscopic effective state in the presence of waves. This allows insights with precise attributable cause-to-effect relationships of specific observed traffic patterns. We establish a principled way of generating macroscopic flow quantities from microscopic models in the unstable regime. Those quantities are then used to study how the corresponding non-equilibrium wave structures manifest in the fundamental diagram, based on three basic scenarios that can serve as building blocks for understanding more complex micro-simulation studies. Finally, this study gives insight on the shapes of the reduced fundamental diagrams for different commonly used microscopic models.

physics.soc-ph↗

Why it is sufficient to consider only the case where the seed of linear cellular automata is $1$

When using a cellular automaton (CA) as a fractal generator, consider orbits from the single site seed, an initial configuration that gives only a single cell a positive value. In the case of a two-state CA, since the possible states of each cell are $0$ or $1$, the "seed" in the single site seed is uniquely determined to be the state $1$. However, for a CA with three or more states, there are multiple candidates for the seed. For example, for a $3$-state CA, the possible states of each cell are $0$, $1$, and $2$, so the candidates for the seed are $1$ and $2$. For a $4$-state CA, the possible states of each cell are $0$, $1$, $2$, and $3$, so the candidates for the seed are $1$, $2$, and $3$. Thus, as the number of possible states of a CA increases, the number of seed candidates also increases. In this paper, we prove that for linear CAs it is sufficient to consider only the orbit from the single site seed with the seed $1$.

math.DS↗

Discrete and continuous mathematical models of sharp-fronted collective cell migration and invasion

Mathematical models describing the spatial spreading and invasion of populations of biological cells are often developed in a continuum modelling framework using reaction-diffusion equations. While continuum models based on linear diffusion are routinely employed and known to capture key experimental observations, linear diffusion fails to predict well-defined sharp fronts that are often observed experimentally. This observation has motivated the use of nonlinear degenerate diffusion, however these nonlinear models and the associated parameters lack a clear biological motivation and interpretation. Here we take a different approach by developing a stochastic discrete lattice-based model incorporating biologically-inspired mechanisms and then deriving the reaction-diffusion continuum limit. Inspired by experimental observations, agents in the simulation deposit extracellular material, that we call a substrate, locally onto the lattice, and the motility of agents is taken to be proportional to the substrate density. Discrete simulations that mimic a two--dimensional circular barrier assay illustrate how the discrete model supports both smooth and sharp-fronted density profiles depending on the rate of substrate deposition. Coarse-graining the discrete model leads to a novel partial differential equation (PDE) model whose solution accurately approximates averaged data from the discrete model. The new discrete model and PDE approximation provides a simple, biologically motivated framework for modelling the spreading, growth and invasion of cell populations with well-defined sharp fronts

nlin.CG↗

Fitting Stochastic Lattice Models Using Approximate Gradients

Stochastic lattice models (sLMs) are computational tools for simulating spatiotemporal dynamics in physics, computational biology, chemistry, ecology, and other fields. Despite their widespread use, it is challenging to fit sLMs to data, as their likelihood function is commonly intractable and the models non-differentiable. The adjacent field of agent-based modelling (ABM), faced with similar challenges, has recently introduced an approach to approximate gradients in network-controlled ABMs via reparameterization tricks. This approach enables efficient gradient-based optimization with automatic differentiation (AD), which allows for a directed local search of suitable parameters rather than estimation via black-box sampling. In this study, we investigate the feasibility of using similar reparameterization tricks to fit sLMs through backpropagation of approximate gradients. We consider four common scenarios: fitting to single-state transitions, fitting to trajectories, inference of lattice states, and identification of stable lattice configurations. We demonstrate that all tasks can be solved by AD using four example sLMs from sociology, biophysics, image processing, and physical chemistry. Our results show that AD via approximate gradients is a promising method to fit sLMs to data for a wide variety of models and tasks.

nlin.CG↗

Boolean Networks as Predictive Models of Emergent Biological Behaviors

Interacting biological systems at all organizational levels display emergent behavior. Modeling these systems is made challenging by the number and variety of biological components and interactions (from molecules in gene regulatory networks to species in ecological networks) and the often-incomplete state of system knowledge (e.g., the unknown values of kinetic parameters for biochemical reactions). Boolean networks have emerged as a powerful tool for modeling these systems. We provide a methodological overview of Boolean network models of biological systems. After a brief introduction, we describe the process of building, analyzing, and validating a Boolean model. We then present the use of the model to make predictions about the system's response to perturbations and about how to control (or at least influence) its behavior. We emphasize the interplay between structural and dynamical properties of Boolean networks and illustrate them in three case studies from disparate levels of biological organization.

q-bio.MN↗

The role of intra- and inter-group Matthew effect in the social dilemma of public goods games

The Matthew effect describes the phenomenon where the rich tend to get richer. Such a success-driven mechanism has been studied in spatial public goods games in an inter-group way, where each individual's social power is enhanced across all groups. For instance, factors like knowledge can exert an advantage across various social contexts. In contrast, certain factors, especially local material goods, only enhance advantages within their current group. Building on this, we further explore the intra-group Matthew effect where the enhancement of social power is calculated separately in each group. Our findings indicate that the intra-group Matthew effect sustains cooperation more at high productivity, while the inter-group Matthew effect promotes cooperation at low productivity. Moreover, the mixture of the intra- and inter-group Matthew effect harms cooperation. This study provides insights into addressing social dilemmas by adjusting wealth accumulation across diverse social groups.

physics.soc-ph↗

Autoencoder-assisted study of directed percolation with spatial long-range interactions

Spatial L{é}vy-like flights are introduced as a way in the absorbing phase transitions to produce non-local interactions. We utilize the autoencoder, an unsupervised learning method, to predict the critical points for $(1+1)$-d directed percolation with such spatial long-range interactions. After making a global coverage of the reaction-diffusion distance and taking a series of different values for the parameter $β$ in the distribution $P(r){\sim}1/r^β$, the critical points $P_c$ that can be continuously varied are obtained. And the dynamic decay of the particle density under the critical points was counted as a way to determine the critical exponent $δ$ of the survival rate. We also investigate the active behavior of the system's particles under the critical point with increasing time steps, which allows us to determine the characteristic time $t_f$ of the finite-scale systems. And the dynamic exponents $z$ are obtained using the scaling relation $t_f{\sim}L^{z}$. We find that the autoencoder can identify this characteristic evolutionary behavior of particles. Finally, we discuss the compliance of the scaling form $1/δ-(β-2)/δz=2$ in different $β$ intervals as well as a method to introduce a global scaling mechanism by generating a random walking step using the L{é}vy distribution.

cond-mat.stat-mech↗

Traffic flow phase transition phenomena based on the kinetic approach

We develop a discrete Boltzmann-type model that uses dynamics in phase space to describe the behavior of traffic flows. Firstly, we model the traffic flow at mesoscopic scale using dynamics in phase space, which is considered as an evolution model in a graph, and we demonstrate the existence of phase transition phenomena through theoretical analysis. Secondly, we assumed the density of vehicles in geometric space to be homogeneous and single-peaked, respectively, and performed numerical simulations to obtain the results consistent with experience. According to this model, we can perform effective simulations on the effects played by multiple parameters on the traffic flow.

nlin.CG↗

Exploring Multiple Neighborhood Neural Cellular Automata (MNNCA) for Enhanced Texture Learning

Cellular Automata (CA) have long been foundational in simulating dynamical systems computationally. With recent innovations, this model class has been brought into the realm of deep learning by parameterizing the CA's update rule using an artificial neural network, termed Neural Cellular Automata (NCA). This allows NCAs to be trained via gradient descent, enabling them to evolve into specific shapes, generate textures, and mimic behaviors such as swarming. However, a limitation of traditional NCAs is their inability to exhibit sufficiently complex behaviors, restricting their potential in creative and modeling tasks. Our research explores enhancing the NCA framework by incorporating multiple neighborhoods and introducing structured noise for seed states. This approach is inspired by techniques that have historically amplified the expressiveness of classical continuous CA. All code and example videos are publicly available on https://github.com/MagnusPetersen/MNNCA.

cs.NE↗