Self-dual planar hypergraphs and exact bond percolation thresholds
The electronic journal of combinatorics, Tome 18 (2011) no. 1
A generalized star-triangle transformation and a concept of triangle-duality have been introduced recently in the physics literature to predict exact percolation threshold values of several lattices. Conditions for the solution of bond percolation models are investigated, and an infinite class of lattice graphs for which exact bond percolation thresholds may be rigorously determined as the solution of a polynomial equation are identified. This class is naturally described in terms of hypergraphs, leading to definitions of planar hypergraphs and self-dual planar hypergraphs. There exist infinitely many self-dual planar 3-uniform hypergraphs, and, as a consequence, there exist infinitely many real numbers $a \in [0,1]$ for which there are infinitely many lattices that have bond percolation threshold equal to $a$.
@article{10_37236_548,
author = {John C. Wierman and Robert M. Ziff},
title = {Self-dual planar hypergraphs and exact bond percolation thresholds},
journal = {The electronic journal of combinatorics},
year = {2011},
volume = {18},
number = {1},
doi = {10.37236/548},
zbl = {1217.05172},
url = {http://geodesic.mathdoc.fr/articles/10.37236/548/}
}
John C. Wierman; Robert M. Ziff. Self-dual planar hypergraphs and exact bond percolation thresholds. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/548
Cité par Sources :