2007/12/12 by Jean‐Baptiste Rouquier, Jean-Baptiste Rouquier, Rouquier, Jean-Baptiste +2
Computer Science · Mathematics · Physics and Astronomy · #Cellular Automata and Applications #Cellular Automata and Lattice Gases (nlin.CG) #FOS: Physical sciences #Stochastic processes and statistical mechanics #Theoretical and Computational Physics #nlin.CG
paper · pdf · doi:10.48550/arxiv.0712.1992
arxiv created 2007/12/12 · openalex publication_date 2007/12/12 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We say that a Cellular Automata (CA) is coalescing when its execution on two distinct (random) initial configurations in the same asynchronous mode (the same cells are updated in each configuration at each time step) makes both configurations become identical after a reasonable time. We prove coalescence for two elementary rules, non coalescence for two other, and show that there exists infinitely many coalescing CA. We then conduct an experimental study on all elementary CA and show that some rules exhibit a phase transition, which belongs to the universality class of directed percolation.