Sharp threshold for percolation on expanders

Itai Benjamini, Stéphane Boucheron, Gábor Lugosi, Raphaël Rossignol

Research output: Contribution to journalArticlepeer-review

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 languageEnglish
Pages (from-to)130-145
Number of pages16
JournalAnnals of Probability
Volume40
Issue number1
DOIs
StatePublished - Jan 2012

All Science Journal Classification (ASJC) codes

  • Statistics and Probability
  • Statistics, Probability and Uncertainty

Fingerprint

Dive into the research topics of 'Sharp threshold for percolation on expanders'. Together they form a unique fingerprint.

Cite this