Two Phase Transitions in Two-Way Bootstrap Percolation.

Ahad N. Zehmakan

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 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
Title of host publicationLeibniz International Proceedings in Informatics (LIPIcs)
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Pages5:1-5:21
ISBN (Print)978-3-95977-130-6
DOIs
Publication statusPublished - 2019
Externally publishedYes

Fingerprint

Dive into the research topics of 'Two Phase Transitions in Two-Way Bootstrap Percolation.'. Together they form a unique fingerprint.

Cite this