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
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 |
|---|---|
| Number of pages | 14 |
| Journal | Discret. Math. |
| Volume | 344 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - Jan 2021 |
| Externally published | Yes |
Fingerprint
Dive into the research topics of 'Threshold behavior of bootstrap percolation.'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver