Skip to main navigation Skip to search Skip to main content

Threshold behavior of bootstrap percolation.

  • Ahad N. Zehmakan

Research output: Contribution to journal › Article › peer-review

5 Citations (Scopus)

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 languageEnglish
Number of pages14
JournalDiscret. Math.
Volume344
Issue number2
DOIs
Publication statusPublished - Jan 2021
Externally publishedYes

Fingerprint

Dive into the research topics of 'Threshold behavior of bootstrap percolation.'. Together they form a unique fingerprint.

Cite this