Majority Bootstrap Percolation on $G(n,p)$

Abstract

Majority bootstrap percolation on a graph $G$ is an epidemic process defined in the following manner. Firstly, an initially infected set of vertices is selected. Then step by step the vertices that have more infected than non-infected neighbours are infected. We say that percolation occurs if eventually all vertices in $G$ become infected. In this paper we study majority bootstrap percolation on the Erdős-Rényi random graph $G(n,p)$ above the connectivity threshold. Perhaps surprisingly, the results obtained for small $p$ are comparable to the results for the hypercube obtained by Balogh, Bollobás and Morris (2009).