Percolation on a product of two trees
classification
🧮 math.PR
keywords
percolationproducttreesconditioncriticaldegreedegreesexamine
read the original abstract
We show that critical percolation on a product of two regular trees of degree $\ge$ 3 satisfies the triangle condition. The proof does not examine the degrees of vertices and is not "perturbative" in any sense. It relies on an unpublished lemma of Oded Schramm.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.