Sharp threshold for percolation on expanders (Q662426)

This paper deals with percolation in expanders of bounded degree. The authors study the appearance of a giant component in random subgraphs of a given large finite graph in which each edge is present independently with a certain probability. For finite graphs, ``giant'' means a component of size linear in the number of vertices of the original graph. The authors show that, if the original graph is an expander with vertices of bounded degree, then the property that a random subgraph contains a giant component with a linear coefficient between zero and one has a sharp threshold.