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.
| Original language | English |
|---|---|
| Pages (from-to) | 130-145 |
| Number of pages | 16 |
| Journal | Annals of Probability |
| Volume | 40 |
| Issue number | 1 |
| DOIs | |
| State | Published - Jan 2012 |
All Science Journal Classification (ASJC) codes
- Statistics and Probability
- Statistics, Probability and Uncertainty