2000 character limit reached
Site Percolation on a Disordered Triangulation of the Square Lattice (1704.04930v1)
Published 17 Apr 2017 in math.PR
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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.