Non-triviality of the phase transition for percolation on finite transitive graphs

arXiv2104.05607MaRDI QIDQ6504449FDOQ6504449

Authors: Tom Hutchcroft, Matthew C. H. Tointon

Abstract: We prove that if

(G_{n})_{n g e q 1} = ((V_{n}, E_{n}))_{n g e q 1}

is a sequence of finite, vertex-transitive graphs with bounded degrees and

| V_{n} | o i n f t y

that is at least

(1 + e p s i l o n)

-dimensional for some

e p s i l o n > 0

in the sense that [mathrm{diam} (G_n)=Oleft(|V_n|^{1/(1+epsilon)} ight) ext{ as

n o i n f t y

}] then this sequence of graphs has a non-trivial phase transition for Bernoulli bond percolation. More precisely, we prove under these conditions that for each

0 < a l p h a < 1

there exists

p_{c} (a l p h a) < 1

such that for each

p g e q p_{c} (a l p h a)

, Bernoulli-

p

bond percolation on

G_{n}

has a cluster of size at least

a l p h a | V_{n} |

with probability tending to

1

as

n o i n f t y

. In fact, we prove more generally that there exists a universal constant

a

such that the same conclusion holds whenever [mathrm{diam} (G_n)=Oleft(frac{|V_n|}{(log |V_n|)^a} ight) ext{ as

n o i n f t y

.}] This verifies a conjecture of Benjamini up to the value of the constant

a

, which he suggested should be

1

. We also prove a generalization of this result to quasitransitive graph sequences with a bounded number of vertex orbits and prove that one may indeed take

a = 1

when the graphs

G_{n}

are all Cayley graphs of Abelian groups. A key step in our proof is to adapt the methods of Duminil-Copin, Goswami, Raoufi, Severo, and Yadin from infinite graphs to finite graphs. This adaptation also leads to an isoperimetric criterion for infinite graphs to have a nontrivial uniqueness phase (i.e., to have

p_{u} < 1

) which is of independent interest. We also prove that the set of possible values of the critical probability of an infinite quasitransitive graph has a gap at

1

in the sense that for every

k, n < i n f t y

there exists

e p s i l o n > 0

such that every infinite graph

G

of degree at most

k

whose vertex set has at most

n

orbits under Aut

(G)

either has

p_{c} = 1

or

p_{c} l e q 1 - e p s i l o n

.

This page was built for publication: Non-triviality of the phase transition for percolation on finite transitive graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6504449)