Majority bootstrap percolation on \(G(n,p)\) (Q510304)

Summary: 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 at least half of its neighbours infected become infected. We say that percolation occurs if eventually all vertices in \(G\) become infected. In this paper we provide sharp bounds for the critical size of the initially infected set in majority bootstrap percolation on the Erdős-Rényi random graph \(G(n,p)\). This answers an open question by \textit{S. Janson} et al. [Ann. Appl. Probab. 22, No. 5, 1989--2047 (2012; Zbl 1254.05182)]. Our results obtained for \(p=c\log(n)/n\) are close to the results obtained by \textit{J. Balogh} et al. [Comb. Probab. Comput. 18, No. 1--2, 17--51 (2009; Zbl 1198.60041)] for majority bootstrap percolation on the hypercube. We conjecture that similar results will be true for all regular-like graphs with the same density and sufficiently strong expansion properties.