Abstract
We study the appearance of the giant component in random subgraphs of a given large finite graph G = (V, E) in which each edge is present independently with probability p. We show that if G is an expander with vertices of bounded degree, then for any c ∈ ]0, 1[, the property that the random subgraph contains a giant component of size c|V| has a sharp threshold.
Citation
Itai Benjamini. Stéphane Boucheron. Gábor Lugosi. Raphaël Rossignol. "Sharp threshold for percolation on expanders." Ann. Probab. 40 (1) 130 - 145, January 2012. https://doi.org/10.1214/10-AOP610
Information
