Search arXiv⌕ Search

arXiv · 2610.15333

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

Abstract

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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hiroki Yamamoto, Daichi Yanagisawa, Katsuhiro Nishinari. 2026-10-11. Geometry-Controlled Initial-Density Dependence in Branching-Merging Exclusion Processes. https://arxiv.org/abs/2610.15333

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Frobenius Revivals in Laplacian Cellular Automata: Replication, Entropy, and Information Recovery

We investigate Frobenius revivals in prime-modulus Laplacian cellular automata. The Frobenius identity yields exact superpositions of translated, coefficient-weighted seed copies at prime-power times; we distinguish this algebraic replication from their geometric separation. We investigate seed recovery from separated replicas and evaluate the correction of independent symbol errors introduced during transmission of encoded configurations. For the diagonal neighborhood, we determine the exact periods of moving corner operators on square windows and establish sufficient conditions for recovering any binary seed under a binary--ternary--binary schedule. The results connect prime-power algebraic structure with spatial pattern formation and precisely delimited forms of information recovery.

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↗

Dynamics in a Low-Rank Separable Field Cellular Automaton

Cellular automata (CA) are widely used to study how simple rules generate life-like behavior, typically through local interactions. Here, we introduce a Separable-Field Cellular Automaton (SFCA), in which conventional local-neighborhood interactions are replaced by updates governed by a normalized global coupling field. Each cell is updated according to q = n/n_max, with survival and birth controlled by threshold intervals S and B. Systematic scans over interval widths and positions revealed four outcome classes: extinction, fixed points, cycles, and long transients. The phase diagram was organized by the relative geometry of S and B: fixed points were enriched when B was contained within S, whereas long transients concentrated near the boundary between partial overlap and no overlap. A fine scan across this transition revealed a narrow long-transient ridge separating two distinct cycle-dominated regimes: a dense, high-change-rate branch approximating global period-2 alternation and a sparse, low-change-rate, stripe-like branch. Damage-spreading analyses were consistent with delayed selection between these cyclic attractor families and provided no evidence for sustained exponential trajectory separation. Finite-size analyses showed that the ridge persists across all tested lattice sizes, although its position shifts systematically with system size. These results show that structured long-lived dynamics can arise under separable global coupling with a field matrix of rank at most one, suggesting that nontrivial collective organization can persist under strongly compressed interaction architectures.

nlin.CG↗