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 667 records · Page 37Linked to original sources

Bridging simulation length scales with cellular automata

Multiscale simulation requires coupling physics models that operate at different characteristic length and time scales, because no single method spans the range needed for most problems of interest. Moving to a coarser-grained representation unlocks longer length and time scales, but it discards the microscopic interactions that build morphology. A fine-grained model can be initialized from an arbitrary packing and left to self-assemble into a physically meaningful structure; a lower-resolution model cannot, and must inherit its starting configuration from a higher-fidelity simulation. The length scales accessible to the coarse-grained model are therefore set not by the coarse-grained method itself, but by the largest fine-grained configuration that can be affordably equilibrated. A representative example is the scale-up from particle-based molecular dynamics (MD) to a lattice-based representation such as kinetic Monte Carlo (kMC). In this work, we present a cellular automata (CA) approach for generating arbitrarily large lattice starting configurations. CA is a natural fit for this task: short-ranged local rules drive the evolution of a lattice, and their repeated application gives rise to emergent long-range order, thematically mirroring how short-ranged interactions in MD produce self-assembled morphology. We use a configuration from a higher-fidelity simulation as a training set and learn the CA rules from it via logistic regression. As a proof of principle, we develop these rules for a hydrated anion exchange membrane (AEM), generate new starting configurations, and benchmark their performance in mesoscale kMC simulations against an MD-derived "ground truth." We then demonstrate the ability to generate substantially larger lattices and show that their behavior in kMC is consistent with that of the smaller CA benchmark configurations.

cond-mat.mtrl-sci↗

Finite Configurations Cannot Generate a Constant Trace in Rule 30

For every right half we determine the unique left half whose Rule 30 central trace is constant: an alternating tail selected by the leading one of the right half when the initial center is 0, and a single universal checkerboard when it is 1. Every nonzero member of either fiber carries infinitely many ones, so the zero row is the only finite configuration with a constant trace. For support radius w the sharp maximum constant-prefix length is 2*ceil(w/2)+1 when the initial center is 0 and 2*floor(w/2)+2 when it is 1, so the maximum over both is w+2, attained by exactly 2^w configurations for even w and 2^w - 1 for odd w. Hence no column of a nonzero finite Rule 30 orbit is eventually constant.

math.DS↗

Local decoders for fault-tolerant quantum computation and translation-invariant stabilizer codes

We construct the first fully spatially local fault-tolerant quantum computer based on topological codes in fewer than four spatial dimensions. Our construction is a two-dimensional architecture that uses only geometrically local quantum and classical operations, bounded-speed classical communication and computation, and a constant density of quantum and classical resources. The core component is a new time-translation-invariant cellular-automaton decoder for the surface code. This decoder preserves logical information for a time stretched-exponential in the code distance and operates continuously during state injection, stabilizer-state preparation, lattice surgery, and transversal readout. We also prove that every translation-invariant topological Pauli stabilizer code is locally decodable under phenomenological noise.

quant-ph↗

Gliders on Aperiodic Monotilings: Cellular Automata on the Hat and Spectre

The hat and spectre monotiles, discovered in 2023, tile the plane only aperiodically. Cellular automata are studied here on patches generated by finite-state transducers, so that every experiment regenerates deterministically from a small record. Within edge-adjacency semi-totalistic rules, exhaustive and evolutionary searches find only mortal travelers: gliders are absent. Guided by a reproduction of the known Penrose-tiling glider, the rule space is extended to vertex neighborhoods and to priority-table rules whose non-quiescent states are visible to neighbors. Evolutionary search then discovers gliders on both monotilings; tracked by a sliding window that regenerates the patch along the flight, they travel one million rings at constant speed and heading. All headings are quantized, to millidegrees, onto a six-spoke compass: the fast axes of the tiling's graph metric. An ablation shows both rule-space extensions are individually necessary. All results replay exactly in an accompanying interactive essay.

nlin.CG↗

Causal graph rewriting

We introduce causal graph rewriting, a model of computation in which local rules are applied on directed acyclic graphs in an asynchronous manner. The non-determinism arising from asynchrony is disciplined by the oriented edges, which must be understood as both computational dependencies and locality constraints---and are themselves subject to the rewriting. We illustrate the model through two examples: a particle system, and a time-dilation example---reminiscent of general relativity. We study the well-definedness and properties of induced subgraphs and graph composition, which isolate and recombine the region affected by a rewrite. We then study locality with respect to these constructions, showing how a local rewrite preserves positions, borders, and context. Our main result concerns sequential composition: locality extends from single rule applications to arbitrary valid sequences, as any local rule is automatically $*$-local and $*$-extensive. We also formalise and prove the simulation of any one-dimensional cellular automaton.

cs.FL↗

Finite-ring obstructions for quadratic binary radius-two cellular automata

We study one-dimensional binary cellular automata with a five-slot radius-two local rule of exact algebraic-normal-form degree two, acting on periodic rings of length n. We prove that every such rule is non-injective whenever 4 | n and n >= 8. The proof begins with the four-cell collapse, where the two extreme formal slots coincide. A structural classification of the resulting four-variable maps separates the 65,472 exactly quadratic rules into 63,456 rules with an immediate ring-four collision and 2,016 exceptional lifts. The latter split into layers of sizes 480 and 1,536. Their remaining finite obligations are represented by 136 parameter-region constructions and 768 per-lift records, respectively. Each certificate supplies differentiating closed walks of lengths 8 and 12 with a common pair-graph base vertex. Concatenation then gives lengths 8a + 12b, which are exactly the multiples of four from eight onward. The load-bearing finite certificate core therefore contains 904 = 136 + 768 independently replayable objects checked by standalone, non-searching programs. The complete checker CLIs additionally reconstruct expected populations and execute coverage, complement, and regression/guard checks; 904 is not a count of total checker operations. Periodic extension also yields full-shift non-injectivity; that consequence is used here only as a corollary.

cs.FL↗

Reasoning with Neural Cellular Automata

Modern AI architectures used to solve visual reasoning tasks typically rely heavily on global connectivity and synchronization. As biological systems demonstrate, though, sophisticated computation can be performed in a more decentralized fashion. In this work, we test the reasoning capabilities of Neural Cellular Automata (NCAs), networks of recurrent cells that use strictly local connectivity and asynchronous updates. NCAs have been extensively studied in artificial life experiments, but it is unclear whether they can perform complex multi-step reasoning. We show that NCAs produce spatio-temporal dynamics capable of solving challenging visual reasoning tasks, including large mazes, Sudoku, and ARC-AGI-1. Furthermore, we provide evidence that NCAs generalize out-of-distribution when running with larger grids, longer rollouts, or parallel trials; and that the latter can be made more efficient via pruning of redundant trajectories. We find that these generalization capabilities depend on training with sample replay and stochastic perturbations, and that stochasticity remains beneficial at test time. Finally, we show that NCAs are robust reasoners capable of dynamically modulating compute to recover efficiently from damage, and that they can scale to solve reasoning in raw pixel space.

cs.LG↗

Analytical derivation of a three-dimensional fundamental diagram for a real-valued max-plus particle system

We study a real-valued max-plus particle system on a finite periodic lattice. Its three-dimensional fundamental diagram relates the mean flow to two densities: the conserved particle density and a second density defined by a local state function. We prove that the deviation from the diagram tends to zero for arbitrary initial data with all state values in [0,1]. The proof uses two nonnegative local quantities and their evolution relations. For rational initial data with all state values in $[0,1]$, the orbit is eventually periodic, and the fundamental-diagram relation holds exactly on the periodic orbit.

nlin.CG↗

A repeating sequence of simple rules creates a universal computer

We show that the Turing complete rule 110 in elementary cellular automata can be emulated by alternating three simple symmetric rules in space. As the constituent rules themselves are trivial, this shows that diversity alone can generate emergent phenomena. The rules cannot distinguish left from right, and the chirality of rule 110 is created by their arrangement. Random initial conditions lock on to rule 110 over 90% of the time, explained through the motion of domain walls between desynchronized regions. Adding random noise creates errors that seed domain walls, whose fraction scales with the square root of noise strength, explained through a simple rate equation. This points to a route to complexity through repeated, perturbed units, common in biology, and shows that in cellular automaton models of quantum field theory, broken symmetries such as parity need not be present in the local rules.

nlin.CG↗

Shape irregularity of Life-Like Network Automaton rules as an indicator of classification performance

Complex Network (CN) classification requires high-level structural characterizations that are both scale-invariant and computationally efficient. Methods based on Life-Like Network Automata (LLNA) offer an interesting way to extract network descriptors by leveraging emergent temporal patterns without requiring provided features, but their efficacy is bottlenecked by a high-cost combinatorial optimization problem: the selection of the automaton transition rule. While current literature relies on exhaustive searches that are unfeasible for large-scale applications, this work reveals that the rule space is fundamentally structured by a property we term ``jaggedness'', that quantifies the resemblance of a LLNA transition function with a sawtooth shape. We demonstrate that this metric acts as a theoretical proxy for chaoticity and sensitivity -- properties essential for generating discriminative dynamic behaviors among network categories. Moreover, we introduce a heuristic search strategy that uses jaggedness to guide the rule selection. Experimental results show that our approach achieves classification accuracies within 5% of the global optimum while reducing computational overhead by 90% compared to exhaustive approach. Our findings provide a novel, efficient, framework for optimizing automata-based methods for pattern recognition.

cs.LG↗

Idempotence criteria for lazy cellular automata

A lazy cellular automaton $τ:A^G\to A^G$ is determined by a finite neighborhood $S\subseteq G$ containing the group identity $e$, a pattern $p\in A^S$, and a writing symbol $a\in A\setminus\{p(e)\}$: its local rule is equal to the projection to $e$ except when it reads the pattern $p$, in which case it writes $a$. For a nonempty subset $T$ of the fiber $S_a:= p^{-1}(a)$, we introduce compatibility conditions on $p$ along the right translates $St$, $t\in T$. We show that, over every group, the existence of a compatible set is necessary for $τ$ to be non-idempotent, and that it is also sufficient whenever $st = ts$ for all $t \in S_a$, $s \in S_{p(e)}$. In particular, compatibility characterizes non-idempotence over abelian groups, which reduces deciding idempotence to a search over subsets of $S_a$. Finally, for every dihedral group $D_n$ with $n\geq 4$, we construct an idempotent lazy cellular automaton that admits a compatible set, showing that the commutation hypothesis cannot simply be dropped.

math.GR↗

Robust Golden Ratio universality as a consequence of a circulant symmetry

We find a robust scenario for the emergence of the Golden Ratio (GR) dynamical universality class, characterized by the dynamical exponent $z \equiv φ=\frac{1}{2}(1+\sqrt{5})$. Previously, its emergence required fine-tuning of system parameters. Here, the GR universality class appears generically in a wide class of Markov processes as a consequence of a global, circulant symmetry of the flux Jacobian. This symmetry leads to GR universality in systems where the total number of conservation laws is odd and larger than three. We introduce a multilane exclusion process with Bernoulli stationary measure as a minimal, parameter-free model, which features GR universality for all conserved modes, most of which are doubly degenerate. Our predictions, based on mode-coupling theory generalized to treat degenerate conserved modes, are corroborated by large-scale Monte Carlo simulations.

cond-mat.stat-mech↗

Towards New Parity Rules with Asynchronous Updating Inspired by Fatès's Rule

The parity problem in 1D Cellular Automata is a classifier based on a local rule. If the number of ones in a ring of binary cells is odd then the automaton shall converge to all-one (11...11) else to all-zero (00...00). The objective is to find rules that are related to Fatès's Balanced Rule F but use less active neighborhoods (actions). The method is to analyze the effect of each actions and to find a functioning subset of the 12 actions used in rule F. New rules called HA, HB, HC, HF are defined with 10, 6, 4, 8 actions. Rule HC and HF need only three inputs whereas all others need four. The classification time of the rules was determined by averaging over many simulation runs with random initial configurations. It is almost the same for the rules HA and F, and is longer for the rules HB, HC, HF. In addition, the rule HD is defined, which updates three cells in parallel and works faster. In future work, the functioning and performance of the proposed rules should be treated in a more formal way, and related rules (also with different update schemes) could be considered.

nlin.CG↗

Geometry-Controlled Initial-Density Dependence in Branching-Merging Exclusion Processes

We study geometry-controlled, initial-density-dependent stationary states in exclusion processes with branching-merging structures. We consider two boundary geometries for connecting the parallel branches to the reservoirs: the \(1\)-\(n\)-\(1\) model, in which a single lane branches into \(n\) parallel lanes and then merges back into a single lane, and the \(0\)-\(n\)-\(0\) model, in which particles directly enter and leave the \(n\) parallel lanes. For both models, we derive critical initial densities separating the low-density, shock-wave, and high-density regimes, and show that the theoretical predictions reproduce the phase diagrams and branch-averaged densities observed in simulations. In the \(1\)-\(n\)-\(1\) geometry, the critical initial densities depend on both the number of branches and the lengths of the upstream and downstream single-lane segments, whereas in the \(0\)-\(n\)-\(0\) geometry the corresponding estimates depend only on the number of branches. These results show that initial-condition dependence can arise from the global geometry of a branching-merging exclusion process, even without an explicit friction rule at the merging point.

nlin.CG↗

When do lazy and invertible cellular automata generate all cellular automata?

Let $G$ be a group and let $A$ be a set with at least two elements. A lazy cellular automaton over $A^G$ acts as the identity except at the cells where a fixed pattern occurs, where it replaces the central symbol by a fixed different symbol. Let $M(G;A)$ be the submonoid of $\mathrm{CA}(G;A)$ generated by the lazy and the invertible cellular automata. We study when $M(G;A) = \mathrm{CA}(G;A)$. Since no lazy cellular automaton is surjective, every surjective element of $M(G;A)$ is invertible; hence $M(G;A) \neq \mathrm{CA}(G;A)$ whenever $A$ is infinite or $G$ has an element of infinite order. Moreover, if $|A| = 2$ and $G$ has a quotient isomorphic to the Klein four-group $C_2 \times C_2$, then $M(G;A) \neq \mathrm{CA}(G;A)$. For locally finite $G$, and in particular for finite $G$, these are the only obstructions: we prove that $M(G;A) = \mathrm{CA}(G;A)$ if and only if $3 \leq |A| < \infty$, or $|A| = 2$ and $G$ has no quotient isomorphic to $C_2 \times C_2$.

math.GR↗

A Parallel Processing Algorithm for Computing Short-Range Particle Forces with Inhomogeneous Particle Distributions

We present a computational algorithm for computing short range forces between particles. The algorithm has two distinguishing features. First, it is optimized for multi-processor computers, and will use as many processors as are available. Second, it is optimized for inhomogeneous, dynamic particle distributions; for any distribution the computational load is distributed evenly to all processors, and the communication time is less than 15\% of the total run time. In this talk we present our new algorithm. We developed the program for a grand-challenge problem in cosmology, simulation of the formation of large-scale structure in the universe. This simulation, run on the Thinking Machines Corporation CM-5, uses the particle-particle/particle-mesh (PPPM) \cite{hock_east} algorithm. The particle-particle phase is computed using the algorithm we describe in this paper. We discuss this and other applications.

astro-ph↗

Braid analysis of (low-dimensional) chaos

Braid theory is used to calcualte the topological entropy of data from the belousov-Zhabotinskii reaction, the results agree well with one-dimensional theory to the order of approximation considered.

chao-dyn↗

A Dynamical Simulation Facility for Hybrid Systems

This paper establishes a general framework for describing hybrid dynamical systems which is particularly suitable for numerical simulation. In this context, the data structures used to describe the sets and functions which comprise the dynamical system are crucial since they provide the link between a natural mathematical formulation of a problem and the correct application of standard numerical algorithms. We describe a partial implementation of the design methodology and use this simulation tool for a specific control problem in robotics as an illustration of the utility of the approach for practical applications.

chao-dyn↗