Site Percolation on a Disordered Triangulation of the Square Lattice
classification
🧮 math.PR
keywords
graphmathbbpercolationsitetriangulationaddingalmostconjecture
read the original abstract
In this paper we consider independent site percolation in a triangulation of $\mathbb{R}^2$ given by adding $\sqrt{2}$-long diagonals to the usual graph $\mathbb{Z}^2$. We conjecture that $p_c=\frac{1}{2}$ for any such graph, and prove it for almost every such graph.
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.