Self-dual planar hypergraphs and exact bond percolation thresholds (Q540045): Difference between revisions
From MaRDI portal
Set profile property. |
Import IPFS CIDs |
||
(One intermediate revision by one other user not shown) | |||
Property / arXiv ID | |||
Property / arXiv ID: 0903.3135 / rank | |||
Normal rank | |||
Property / IPFS content identifier | |||
Property / IPFS content identifier: bafkreiea2lnfibj4yfjgunrngnepsnfsmrgf4c4wmpvx6xkqroy4faul2e / rank | |||
Normal rank |
Latest revision as of 10:13, 22 February 2025
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Self-dual planar hypergraphs and exact bond percolation thresholds |
scientific article |
Statements
Self-dual planar hypergraphs and exact bond percolation thresholds (English)
0 references
1 June 2011
0 references
Summary: 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.
0 references