Abstract
We explicitly construct an uncountable class of infinite aperiodic plane graphs which have equal, and explicitly computable, bond percolation thresholds. Furthermore for both bond percolation and the random-cluster model all large scale properties, such as the values of the percolation threshold and the critical exponents, of the graphs are equal. This equivalence holds for all values of $p$ and all $q\in[0,\infty]$ for the random-cluster model. The graphs are constructed by placing a copy of a rotor gadget graph or its reflection in each hyperedge of a connected self-dual 3-uniform plane hypergraph lattice. The exact bond percolation threshold may be explicitly determined as the root of a polynomial by using a generalised star-triangle transformation. Related randomly oriented models share the same bond percolation threshold value.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
