Tree embeddings and nonuniqueness in site percolation

arXiv:2304.00923 · math.PR, math.CO · Submitted 2023-04-03 · Read on arXiv

math.PR, math.CO

Submitted: 2023-04-03

Updated: 2026-11-05

Comments: 32 pages

License: http://creativecommons.org/licenses/by/4.0/

The gist: Let G be an infinite connected simple graph of minimum degree at least seven.

Terminology

Abstract

Let G be an infinite connected simple graph of minimum degree at least seven. Suppose G is embedded in the plane so that every compact set meets only finitely many vertices and edges. We prove that p c site(G)<1/2 and that, for every p c site(G)<p<1-p c site(G), Bernoulli (p) site percolation almost surely has infinitely many infinite open clusters. We also construct a subtree of G with critical site percolation probability sqrt 2-1. We prove a general stability theorem for infinite connected locally finite graphs G H on the same vertex set. Suppose that, at parameter a in(0,1), the probability that a deterministic finite set meets an infinite open cluster in G tends uniformly to one as its size grows. Then, for each fixed b in(a,1], under the standard monotone coupling, almost surely every infinite open cluster in H at parameter b contains an infinite open cluster in G at parameter a. No planarity, transitivity, or uniform degree bound is required. Finally, we obtain a lower bound on two-point connectivity under uniqueness for arbitrary infinite locally finite graphs, yielding a general criterion for nonuniqueness.

Sources

Related papers