The triangle and the open triangle
From MaRDI portal
Abstract: We show that for percolation on any transitive graph, the triangle condition implies the open triangle condition.
The paper deals with percolation on a vertex-transitive graph. A graph is vertex-transitive if its automorphism group acts transitively upon its vertices. The author shows that for percolation on any transitive graph, the triangle condition implies the open triangle condition.
Recommendations
Cites work
- Critical two-point functions and the lace expansion for spread-out high-dimensional percolation and related models.
- Gap exponents for percolation processes with triangle condition
- Gaussian estimates for Markov chains and random walks on groups
- scientific article; zbMATH DE number 2132156 (Why is no real title available?)
- 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
- The Alexander-Orbach conjecture holds in high dimensions
- Tree graph inequalities and critical behavior in percolation models
Cited in
(6)- Percolation on hyperbolic graphs
- The \(L^2\) boundedness condition in nonamenable percolation
- On the derivation of mean-field percolation critical exponents from the triangle condition
- Nonuniqueness and mean-field criticality for percolation on nonunimodular transitive graphs
- Percolation on a product of two trees
- Critical exponents for marked random connection models
This page was built for publication: The triangle and the open triangle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q629799)