Percolation on a product of two trees
Using the standard concepts of percolation theory (see, e.g., [\textit{G. Grimmett}, Percolation. 2nd ed. Berlin: Springer. (1999; Zbl 0926.60004]) the author studies the \textit{triangle condition} validity. One says that a transitive graph \(G\) satisfies the triangle condition at some \(p\) if \[ \nabla_p:=\sum_{x,y\in G}\mathbb{P}_p(0\longleftrightarrow x)\mathbb{P}_p(x\longleftrightarrow y) \mathbb{P}_p(0\longleftrightarrow y)<\infty. \] \textit{M. Aizenman} and \textit{C. M. Newman} [J. Stat. Phys. 36, 107--143 (1984; Zbl 0586.60096] suggested this condition as a marker for ``mean-field behavior. In particular, they proved that if \(\nabla_{p_c}<\infty\) then \(\mathbb{E}_p|C(0)|\approx (p_c-p)^{-1}\) as \(p\) tends to the critical probability \(p_c\) from below. Here \(C(0)=\{x:0\longleftrightarrow x\}\) and \(|C(0)|\) is its size. In the present paper G. Kozma established that if \(T\) is a regular tree of degree greater than two, then the product graph \(T\times T\) satisfies the triangle condition at \(p_c\). The proof does not examine the degree of vertices and is not ``perturbative in any sense. It relies on an unpublished lemma of O. Schramm.
- Arm exponents in high dimensional percolation
- Critical behavior of percolation and Markov fields on branching planes
- Critical percolation on any nonamenable group has no infinite clusters
- Gap exponents for percolation processes with triangle condition
- Mean-field behavior for long- and finite range Ising model, percolation and self-avoiding walk
- Mean-field critical behaviour for percolation in high dimensions
- Mean-field criticality for percolation on planar non-amenable graphs
- Multiplicity of phase transitions and mean-field criticality on highly non-amenable graphs.
- Percolation
- Percolation critical exponents under the triangle condition
- Percolation on a product of two trees
- Probability on trees and networks
- Random Walks on Infinite Graphs and Groups
- Sharpness of the phase transition and exponential decay of the subcritical cluster size for percolation on quasi-transitive graphs
- Sharpness of the phase transition in percolation models
- The Alexander-Orbach conjecture holds in high dimensions
- The triangle and the open triangle
- Tree graph inequalities and critical behavior in percolation models
- Percolation on hyperbolic graphs
- The \(L^2\) boundedness condition in nonamenable percolation
- Interacting growth processes and invariant percolation
- Statistical physics on a product of trees
- Unlacing hypercube percolation: a survey
- High-dimensional incipient infinite clusters revisited
- Random trees between two walls: exact partition function
- Nonuniqueness and mean-field criticality for percolation on nonunimodular transitive graphs
- Monotonicity and phase diagram for multirange percolation on oriented trees
- Percolation on a k-Ary Tree
- scientific article; zbMATH DE number 4188961 (Why is no real title available?)
- Slightly supercritical percolation on non‐amenable graphs I: The distribution of finite clusters
- Continuity of the Ising phase transition on nonamenable groups
- Slightly supercritical percolation on nonamenable graphs. II: Growth and isoperimetry of infinite clusters
- The triangle and the open triangle
- Percolation on a product of two trees
- Co-spectral radius for countable equivalence relations
This page was built for publication: Percolation on a product of two trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q651007)
