Density classification on infinite lattices and trees

DOI10.1214/EJP.V18-2325zbMath1288.60125OpenAlexW2144903551MaRDI QIDQ388922

Jean Mairesse, Ana Bušić, Irène Marcovici, Nazim Fatès

Publication date: 17 January 2014

Published in: Electronic Journal of Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/ejp.v18-2325

zbMATH Keywords

cellular automatainteracting particle systemsdensity classification

Mathematics Subject Classification ID

Discrete-time Markov processes on general state spaces (60J05) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15)

Related Items (12)

Simply modified GKL density classifiers that reach consensus faster ⋮ Two-Dimensional Traffic Rules and the Density Classification Problem ⋮ Self-stabilisation of Cellular Automata on Tilings ⋮ Overview: PCA Models and Issues ⋮ The Density Classification Problem in the Context of Continuous Cellular Automata ⋮ Self-organisation in cellular automata with coalescent particles: qualitative and quantitative approaches ⋮ Affine continuous cellular automata solving the fixed-length density classification problem ⋮ Remarks on the cellular automaton global synchronisation problem: deterministic versus stochastic models ⋮ Density-conserving affine continuous cellular automata solving the relaxed density classification problem ⋮ Around probabilistic cellular automata ⋮ Amoebae for clustering: a bio-inspired cellular automata method for data classification ⋮ Phase diagrams of majority voter probabilistic cellular automata

This page was built for publication: Density classification on infinite lattices and trees