Search arXiv⌕ Search

SEARCH · Search arXiv

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 937 records · Page 52Linked to original sources
arXiv2015

Statistical Mechanics of Surjective Cellular Automata

Reversible cellular automata are seen as microscopic physical models, and their states of macroscopic equilibrium are described using invariant probability measures. We establish a connection between the invariance of Gibbs measures and the conservation of additive quantities in surjective cellular automata. Namely, we show that the simplex of shift-invariant Gibbs measures associated to a Hamiltonian is invariant under a surjective cellular automaton if and only if the cellular automaton conserves the Hamiltonian. A special case is the (well-known) invariance of the uniform Bernoulli measure under surjective cellular automata, which corresponds to the conservation of the trivial Hamiltonian. As an application, we obtain results indicating the lack of (non-trivial) Gibbs or Markov invariant measures for "sufficiently chaotic" cellular automata. We discuss the relevance of the randomization property of algebraic cellular automata to the problem of approach to macroscopic equilibrium, and pose several open questions. As an aside, a shift-invariant pre-image of a Gibbs measure under a pre-injective factor map between shifts of finite type turns out to be always a Gibbs measure. We provide a sufficient condition under which the image of a Gibbs measure under a pre-injective factor map is not a Gibbs measure. We point out a potential application of pre-injective factor maps as a tool in the study of phase transitions in statistical mechanical models.

math.DS↗
arXiv2015

On the blockage problem and the non-analyticity of the current for the parallel TASEP on a ring

The Totally Asymmetric Simple Exclusion Process (TASEP) is an important example of a particle system driven by an irreversible Markov chain. In this paper we give a simple yet rigorous derivation of the chain stationary measure in the case of parallel updating rule. In this parallel framework we then consider the blockage problem (aka slow bond problem). We find the exact expression of the current for an arbitrary blockage intensity $\varepsilon$ in the case of the so-called rule-184 cellular automaton, i.e. a parallel TASEP where at each step all particles free-to-move are actually moved. Finally, we investigate through numerical experiments the conjecture that for parallel updates other than rule-184 the current may be non-analytic in the blockage intensity around the value $\varepsilon = 0$.

math-ph↗
arXiv2019

Large deviations and one-sided scaling limit of randomized multicolor box-ball system

The basic $κ$-color box-ball (BBS) system is an integrable cellular automaton on one dimensional lattice whose local states take $\{0,1,\cdots,κ\}$ with $0$ regarded as an empty box. The time evolution is defined by a combinatorial rule of quantum group theoretical origin, and the complete set of conserved quantities is given by a $κ$-tuple of Young diagrams. In the randomized BBS, a probability distribution on $\{0,1,\cdots,κ\}$ to independently fill the consecutive $n$ sites in the initial state induces a highly nontrivial probability measure on the $κ$-tuple of those invariant Young diagrams. In a recent work \cite{kuniba2018randomized}, their large $n$ `equilibrium shape' has been determined in terms of Schur polynomials by a Markov chain method and also by a very different approach of Thermodynamic Bethe Ansatz (TBA). In this paper, we establish a large deviations principle for the row lengths of the invariant Young diagrams. As a corollary, they are shown to converge almost surely to the equilibrium shape at an exponential rate. We also refine the TBA analysis and obtain the exact scaling form of the vacancy, the row length and the column multiplicity, which exhibit nontrivial factorization in a one-parameter specialization.

math.PR↗
arXiv2020

One Dimensional Exclusion Process with Dynein Inspired Hops: Simulation and Mean Field Analysis

We introduce a one-dimensional non-equilibrium lattice gas model representing the processive motion of dynein molecular motors over the microtubule. We study both dynamical and stationary state properties for the model consisting of hardcore particles hopping on the lattice with variable step sizes. We find that the stationary state gap-distribution exhibits striking peaks around gap sizes that are multiples of the maximum step size, for both open and periodic boundary conditions. We verified this feature using a mean-field calculation. For open boundary conditions, we observe intriguing damped oscillator-like distribution of particles over the lattice with a periodicity equal to the maximum step size. To characterize transient dynamics, we measure the mean square displacement that shows weak superdiffusive growth with exponent $γ\approx 1.34$ for periodic boundary and ballistic growth ($γ\approx 2$) for open boundary conditions at early times. We also study the effect of Langmuir dynamics on the density profile.

cond-mat.stat-mech↗
arXiv2022

Bootstrap percolation, probabilistic cellular automata and sharpness

We establish new connections between percolation, bootstrap percolation, probabilistic cellular automata and deterministic ones. Surprisingly, by juggling with these in various directions, we effortlessly obtain a number of new results in these fields. In particular, we prove the sharpness of the phase transition of attractive absorbing probabilistic cellular automata, a class of bootstrap percolation models and kinetically constrained models. We further show how to recover a classical result of Toom on the stability of cellular automata w.r.t. noise and, inversely, how to deduce new results in bootstrap percolation universality from his work.

math.PR↗
arXiv2024

Complete ergodicity in one-dimensional reversible cellular automata

Exactly ergodicity in boundary-driven semi-infinite cellular automata (CA) are investigated. We establish all the ergodic rules in CA with 3, 4, and 5 states. We analytically prove the ergodicity for 12 rules in 3-state CA and 118320 rules in 5-state CA with any ergodic and periodic boundary condition, and numerically confirm all the other rules non-ergodic with some boundary condition. We classify ergodic rules into several patterns, which exhibit a variety of ergodic structure.

nlin.CG↗
arXiv2017

Toward a Boundary Regional Control Problem for Boolean Cellular Automata

An important question to be addressed regarding system control on a time interval $[0, T]$ is whether some particular target state in the configuration space is reachable from a given initial state. When the target of interest refers only to a portion of the spatial domain, we speak about regional analysis. Cellular Automata (CA) approach have been recently promoted for the study of control problems on spatially extended systems for which the classical approaches cannot be used. An interesting problem concerns the situation where the subregion of interest is not interior to the domain but a portion of its boundary. In this paper we address the problem of regional controllability of cellular automata via boundary actions, i.e., we investigate the characteristics of a cellular automaton so that it can be controlled inside a given region only acting on the value of sites at its boundaries.

nlin.CG↗
arXiv2018

A Survey of Cellular Automata: Types, Dynamics, Non-uniformity and Applications

Cellular automata (CAs) are dynamical systems which exhibit complex global behavior from simple local interaction and computation. Since the inception of cellular automaton (CA) by von Neumann in 1950s, it has attracted the attention of several researchers over various backgrounds and fields for modelling different physical, natural as well as real-life phenomena. Classically, CAs are uniform. However, non-uniformity has also been introduced in update pattern, lattice structure, neighborhood dependency and local rule. In this survey, we tour to the various types of CAs introduced till date, the different characterization tools, the global behaviors of CAs, like universality, reversibility, dynamics etc. Special attention is given to non-uniformity in CAs and especially to non-uniform elementary CAs, which have been very useful in solving several real-life problems.

cs.FL↗
arXiv2022

Gauge-invariance in cellular automata

Gauge-invariance is a fundamental concept in Physics -- known to provide mathematical justification for the fundamental forces. In this paper, we provide discrete counterparts to the main gauge theoretical concepts directly in terms of Cellular Automata. More precisely, the notions of gauge-invariance and gauge-equivalence in Cellular Automata are formalized. A step-by-step gauging procedure to enforce this symmetry upon a given Cellular Automaton is developed, and three examples of gauge-invariant Cellular Automata are examined.

cs.FL↗
arXiv2022

Cold Dynamics in Cellular Automata: a Tutorial

This tutorial is about cellular automata that exhibit 'cold dynamics'. By this we mean zero entropy, stabilization of all orbits, trivial asymptotic dynamics, etc. These are purely transient irreversible dynamics, but they capture many examples from the literature. A rich zoo of properties is presented and discussed: nilpotency and asymptotic, generic or mu-variants, unique ergodicity, convergence, bounded-changeness, freezingness. They all correspond to the 'cold dynamics' paradigm in some way, and we study their links and differences by various examples and results from the literature. Besides dynamical considerations, we also focus on computational aspects: we show how such 'cold cellular automata' can still compute under their dynamical constraint, and what are their computational limitation.

nlin.CG↗
arXiv2012

Astrobiological Complexity with Probabilistic Cellular Automata

Search for extraterrestrial life and intelligence constitutes one of the major endeavors in science, but has yet been quantitatively modeled only rarely and in a cursory and superficial fashion. We argue that probabilistic cellular automata (PCA) represent the best quantitative framework for modeling astrobiological history of the Milky Way and its Galactic Habitable Zone. The relevant astrobiological parameters are to be modeled as the elements of the input probability matrix for the PCA kernel. With the underlying simplicity of the cellular automata constructs, this approach enables a quick analysis of large and ambiguous input parameters' space. We perform a simple clustering analysis of typical astrobiological histories and discuss the relevant boundary conditions of practical importance for planning and guiding actual empirical astrobiological and SETI projects. In addition to showing how the present framework is adaptable to more complex situations and updated observational databases from current and near-future space missions, we demonstrate how numerical results could offer a cautious rationale for continuation of practical SETI searches.

astro-ph.IM↗
arXiv2015

Analysis of Quantum Particle Automata for Solving the Density Classification Problem

To advance our understanding of Quantum Cellular Automata in problem solving through parallel and distributed computing, this research quantized the density classification problem and adopted the Quantum Particle Automata (QPA) to solve the quantized problem. In order to solve this problem, the QPA needed a unitary operator to carry out the QPA evolution and a boundary partition to make the classification decisions. We designed a Genetic Algorithm (GA) to search for the unitary operators and the boundary partitions to classify the density of binary inputs with length 5. The GA was able to find more than one unitary operator that can transform the QPA in ways such that when the particle was measured, it was more likely to collapse to the basis states that were on the correct side of the boundary partition for the QPA to decide if the binary input had majority density 0 or majority density 1. We analyzed these solutions and found that the QPA evolution dynamic was driven by a particular parameter $θ$ of the unitary operator: a small $θ$ gave the particle small mass hence fast evolution while large $θ$ had the opposite effect. While these results are encouraging, scaling these solutions for binary inputs of arbitrary length of $n$ requires additional analysis, which we will investigate in our future work.

quant-ph↗
arXiv2020

Efficacy of the FDA nozzle benchmark and the lattice Boltzmann method for the analysis of biomedical flows in transitional regime

Flows through medical devices as well as in anatomical vessels despite being at moderate Reynolds number may exhibit transitional or even turbulent character. In order to validate numerical methods and codes used for biomedical flow computations, the U.S. food and drug administration (FDA) established an experimental benchmark, which was a pipe with gradual contraction and sudden expansion representing a nozzle. The experimental results for various Reynolds numbers ranging from 500 to 6500 were publicly released. Previous and recent computational investigations of flow in the FDA nozzle found limitations in various CFD approaches and some even questioned the adequacy of the benchmark itself. This communication reports the results of a lattice Boltzmann method (LBM) based direct numerical simulation (DNS) approach applied to the FDA nozzle benchmark for transitional cases of Reynolds numbers 2000 and 3500. The goal is to evaluate if a simple off the shelf LBM would predict the experimental results without the use of complex models or synthetic turbulence at the inflow. LBM computations with various spatial and temporal resolutions are performed - in the extremities of 44 million to 2.8 billion lattice cells - conducted respectively on 32 CPU cores of a desktop to more than 300'000 cores of a modern supercomputer to explore and characterize miniscule flow details and quantify Kolmogorov scales. The LBM simulations transition to turbulence at a Reynolds number 2000 like the FDA's experiments and acceptable agreement in jet breakdown locations, average velocity, shear stress and pressure is found for both the Reynolds numbers.

physics.flu-dyn↗
arXiv2024

Mechanical cell interactions on curved interfaces

We propose a simple mathematical model to describe the mechanical relaxation of cells within a curved epithelial tissue layer represented by an arbitrary curve in two-dimensional space. This model generalises previous one-dimensional models of flat epithelia to investigate the influence of curvature for mechanical relaxation. We represent the mechanics of a cell body either by straight springs, or by curved springs that follow the curve's shape. To understand the collective dynamics of the cells, we devise an appropriate continuum limit in which the number of cells and the length of the substrate are constant but the number of springs tends to infinity. In this limit, cell density is governed by a diffusion equation in arc length coordinates, where diffusion may be linear or nonlinear depending on the choice of the spring restoring force law. Our results have important implications about modelling cells on curved geometries: (i) curved and straight springs can lead to different dynamics when there is a finite number of springs, but they both converge quadratically to the dynamics governed by the diffusion equation; (ii) in the continuum limit, the curvature of the tissue does not affect the mechanical relaxation of cells within the layer nor their tangential stress; (iii) a cell's normal stress depends on curvature due to surface tension induced by the tangential forces. Normal stress enables cells to sense substrate curvature at length scales much larger than their cell body, and could induce curvature dependences in experiments.

nlin.CG↗
arXiv2018

Kauffman cellular automata on quasicrystal topology

In this paper we perform numerical simulations to study Kauffman cellular automata (KCA) on quasiperiod lattices. In particular, we investigate phase transition, magnetic entropy and propagation speed of the damage on these lattices. Both the critical threshold parameter $p_{c}$ and the critical exponents are estimated with good precision. In order to investigate the increase of statistical fluctuations and the onset of chaos in the critical region of the model, we have also defined a magnetic entropy to these systems. It is seen that the magnetic entropy behaves in a different way when one passes from the frozen regime ($p p_{c}$). For a further analysis, the robustness of the propagation of failures is checked by introducing a quenched site dilution probability $q$ on the lattices. It is seen that the damage spreading is quite sensitive when a small fraction of the lattice sites are disconnected. A finite-size scaling analysis is employed to estimate the critical exponents. From these numerical estimates, we claim that on both pure ($q=0$) and diluted ($q=0.05$) quasiperiodic lattices, the KCA model belongs to the same universality class than on square lattices. Furthermore, with the aim of comparing the dynamical behavior between periodic and quasiperiodic systems, the propagation speed of the damage is also calculated for the square lattice assuming the same conditions. It is found that on square lattices the propagation speed of the damage obeys a power law as $v\sim (p-p_{c})^α$, whereas on quasiperiod lattices it follows a logarithmic law as $v \sim \ln(p-p_{c})^α$.

nlin.CG↗
arXiv2021

p-adic Cellular Neural Networks

In this article we introduce the p-adic cellular neural networks which are mathematical generalizations of the classical cellular neural networks (CNNs) introduced by Chua and Yang. The new networks have infinitely many cells which are organized hierarchically in rooted trees, and also they have infinitely many hidden layers. Intuitively, the p-adic CNNs occur as limits of large hierarchical discrete CNNs. More precisely, the new networks can be very well approximated by hierarchical discrete CNNs. Mathematically speaking, each of the new networks is modeled by one integro-differential equation depending on several p-adic spatial variables and the time. We study the Cauchy problem associated to these integro-differential equations and also provide numerical methods for solving them.

nlin.CG↗