Problems / probability-statistics
probability-statistics / Percolation on nonamenable graphs
The Benjamini-Schramm nonuniqueness conjecture: p_c < p_u for bond percolation on nonamenable quasi-transitive graphs
Theorem 1.1: for every infinite connected locally finite quasi-transitive graph with positive vertex isoperimetric constant, supp<pc∥Tp∥2→2=∥Tpc∥2→2<∞ and pc<p2→2≤pu; there are pc<p1<p2<1 such that, in the uniform-label coupling, almost surely infinitely many infinite clusters exist simultaneously for all p∈[p1,p2]. Corollary 1.2 gives the same for every finite symmetric generating set of every nonamenable finitely generated group. Further consequences: the triangle condition at pc, mean-field critical exponents, and exponential decay of connections below p2→2. It concerns bond percolation only; the site-percolation form of the conjecture and the related pu<1 question for one-ended graphs are not addressed. Constants and the interval depend on G.