Abstract Let (G₍) = ( (V₍, E₍) ) (G n) = ( (V n, E n) ) be a sequence of finite connected vertex-transitive graphs with uniformly bounded vertex degrees such that V₍ | V n | → ∞ as n n → ∞. We say that percolation on G₍ G n has a sharp phase transition (as n n → ∞) if, as the percolation parameter crosses some critical point, the number of vertices contained in the largest percolation cluster jumps from logarithmic to linear order with high probability. We prove that percolation on G₍ G n has a sharp phase transition unless, after passing to a subsequence, the rescaled graph-metric on G₍ G n (rapidly) converges to the unit circle with respect to the Gromov-Hausdorff metric. We deduce that under the same hypothesis, the critical point for the emergence of a giant (i. e. linear-sized) cluster in G₍ G n coincides with the critical point for the emergence of an infinite cluster in the Benjamini-Schramm limit of (G₍) (G n), when this limit exists.
Philip Easo (Fri,) studied this question.