Abstract
Consider a graph G and an initial random configuration, where each node is black with probability p and white otherwise, independently. In discrete-time rounds, each node becomes black if it has at least r black neighbors and white otherwise. We prove that this basic process exhibits a threshold behavior with two phase transitions when the underlying graph is a d-dimensional torus and identify the threshold values.
Original language | English |
---|---|
Title of host publication | Leibniz International Proceedings in Informatics (LIPIcs) |
Publisher | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |
Pages | 5:1-5:21 |
ISBN (Print) | 978-3-95977-130-6 |
DOIs | |
Publication status | Published - 2019 |
Externally published | Yes |