The L2 boundedness condition in nonamenable percolation
Abstract
Let G=(V,E) be a connected, locally finite, transitive graph, and consider Bernoulli bond percolation on G. In recent work, we conjectured that if G is nonamenable then the matrix of critical connection probabilities Tpc(u,v)=Ppc(u v) is bounded as an operator Tpc:L2(V) L2(V) and proved that this conjecture holds for several classes of graphs. We also noted in that work that the conjecture implies two older conjectures, namely that percolation on transitive nonamenable graphs always has a nontrivial nonuniqueness phase, and that critical percolation on the same class of graphs has mean-field critical behaviour. In this paper we further investigate the consequences of the L2 boundedness conjecture. In particular, we prove that the following hold for all transitive graphs: i) The two-point function decays exponentially in the distance for all p<p2 2; ii) If pc<p2 2, then the critical exponent governing the extrinsic diameter of a critical cluster is 1; iii) Below p2 2, percolation is "ballistic" in the sense that the intrinsic distance between two points is exponentially unlikely to be much larger than their extrinsic distance; iv) If pc<p2 2, then \|Tpc\|q q (q-1)-1 and pq q-pc q-1 as q 1. v) If pc<p2 2, then various 'multiple-arm' events have probabilities comparable to the upper bound given by the BK inequality. In particular, the probability that the origin is a trifurcation point is of order (p-pc)3 as p pc. All of these results are new even in the Gromov hyperbolic case. Finally, we apply these results together with duality arguments to compute the critical exponents governing the geometry of intrinsic geodesics at the uniqueness threshold of percolation in the hyperbolic plane.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.