Majority rule cellular automata
From MaRDI portal
Publication:2232605
DOI10.1016/j.tcs.2021.07.035OpenAlexW3191167867MaRDI QIDQ2232605
Ahad N. Zehmakan, Bernd Gärtner
Publication date: 6 October 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.10920
Cites Work
- Unnamed Item
- Unnamed Item
- The complexity of the bootstraping percolation and other problems
- On non-progressive spread of influence through social networks
- Bootstrap percolation on the random graph \(G_{n,p}\)
- On pre-periods of discrete influence systems
- Comportement périodique des fonctions à seuil binaires et applications
- Isotropic majority-vote model on a square lattice
- Size bounds for dynamic monopolies
- Majority-vote cellular automata, Ising dynamics, and \(\mathbf P\)-completeness
- Local frequency dependence and global coexistence
- Dynamic monopolies in tori.
- Local majorities, coalitions and monopolies in graphs: A review
- On the computational complexity of the freezing non-strict majority automata
- On time versus size for monotone dynamic monopolies in regular topologies
- Dynamic monopolies of constant size
- On periodical behaviour in societies with symmetric influences
- Majority model on random regular graphs
- Opinion forming in Erdős-Rényi random graph and expanders
- Dynamic monopolies in two-way bootstrap percolation
- Stirling's Approximation for n!: The Ultimate Short Proof?
- Some Investigations About Synchronization and Density Classification Tasks in One-dimensional and Two-dimensional Cellular Automata Rule Spaces
- Random majority percolation
- Bootstrap percolation on the random regular graph
- Majority Bootstrap Percolation on the Hypercube
- Bootstrap percolation on geometric inhomogeneous random graphs
- The sharp threshold for bootstrap percolation in all dimensions
This page was built for publication: Majority rule cellular automata
