Two Phase Transitions in Two-way Bootstrap Percolation

09/26/2018
by   Ahad N. Zehmakan, et al.
0

Consider the d-dimensional torus T_L^d and an initial random configuration, where each node is black with probability p and white otherwise, independently. In discrete-time rounds, each node gets black if it has at least r black neighbors and white otherwise, for some 1≤ r≤ d. This basic process is known as two-way r-bootstrap percolation. We prove the process exhibits a threshold behavior with two phase transitions. More precisely, for p≪ p^(1) the process reaches fully white configuration, p^(1)≪ p≪ p^(2) results in the stable coexistence of both colors, and p^(2)≪ p outputs fully black configuration asymptotically almost surely.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/28/2018

Tight Bounds on the Minimum Size of a Dynamic Monopoly

Assume that you are given a graph G=(V,E) with an initial coloring, wher...
research
06/03/2020

Spread of Influence in Graphs

Consider a graph G and an initial configuration where each node is black...
research
05/05/2018

Dynamic Monopolies in Reversible Bootstrap Percolation

We study an extremal question for the (reversible) r-bootstrap percolati...
research
07/30/2020

Phase Transitions of the k-Majority Dynamics in a Biased Communication Model

Consider a graph where each of the n nodes is in one of two possible sta...
research
09/06/2023

Data Embroidery with Black-and-White Textures

We investigated data embroidery with black-and-white textures, identifyi...
research
11/24/2017

(Biased) Majority Rule Cellular Automata

Consider a graph G=(V,E) and a random initial vertex-coloring, where eac...
research
08/05/2021

Fairer Chess: A Reversal of Two Opening Moves in Chess Creates Balance Between White and Black

Unlike tic-tac-toe or checkers, in which optimal play leads to a draw, i...

Please sign up or login with your details

Forgot password? Click here to reset