Random majority percolation
From MaRDI portal
Publication:3055887
DOI10.1002/RSA.20281zbMATH Open1202.60152OpenAlexW4240717578MaRDI QIDQ3055887FDOQ3055887
Béla Bollobás, Paul Balister, J. Robert Johnson, Mark Walters
Publication date: 10 November 2010
Published in: Random Structures \& Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20281
Cites Work
- Title not available (Why is that?)
- Statistical mechanics of probabilistic cellular automata.
- Interaction of Markov processes
- On periodical behaviour in societies with symmetric influences
- Large deviations for mean field models of probabilistic cellular automata
- Local frequency dependence and global coexistence
- On the behavior of some cellular automata related to bootstrap percolation
- Equivalence of exponential decay rates for bootstrap percolation like cellular automata
- Finite size scaling in three-dimensional bootstrap percolation
- Metastability effects in bootstrap percolation
- Reliable cellular automata with self-organization
- Critical points of two-dimensional bootstrap percolation-like cellular automata
- The metastability threshold for modified bootstrap percolation in \(d\) dimensions
- Comportement périodique des fonctions à seuil binaires et applications
- Rates for the probability of large cubes being non-internally spanned in modified bootstrap percolation
- A reader's guide to P. Gacs's ``positive rates paper: ``Reliable cellular automata with self-organization.
- On pre-periods of discrete influence systems
- On the Period-Two-Property of the Majority Operator in Infinite Graphs
- Isotropic majority-vote model on a square lattice
- Fixation results for threshold voter systems
Cited In (29)
- Dynamic monopolies in two-way bootstrap percolation
- Edge flipping in graphs
- Percolation games, probabilistic cellular automata, and the hard-core model
- Irreversible conversion processes with deadlines
- Majority rule cellular automata
- Irreversible conversion of graphs
- A computational study of \(f\)-reversible processes on graphs
- Pattern-based computing via sequential phase transitions in hierarchical mean field neuropercolation
- Opinion forming in Erdős-Rényi random graph and expanders
- Opinion Forming in Erdös-Rényi Random Graph and Expanders
- Majority vote in social networks
- Phase transitions in the neuropercolation model of neural populations with mixed local and non-local interactions
- Target set in threshold models
- Reversible iterative graph processes
- Around probabilistic cellular automata
- A sharp threshold for a modified bootstrap percolation with recovery
- Rumor spreading: A trigger for proliferation or fading away
- Convergence Time of Probabilistic Cellular Automata on the Torus
- On the spread of influence in graphs
- Color War: Cellular Automata with Majority-Rule
- Generalized threshold processes on graphs
- Graphs with few \(P_4\)'s under the convexity of paths of order three
- Smallest percolating sets in bootstrap percolation on grids
- Majority dynamics with one nonconformist
- Braided racks, Hurwitz actions and Nichols algebras with many cubic relations.
- The impact of geometry on monochrome regions in the flip Schelling process
- Dynamic matching pennies on networks
- Complexity analysis of \(P_3\)-convexity problems on bounded-degree and planar graphs
- Threshold behavior of bootstrap percolation
This page was built for publication: Random majority percolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3055887)
