2006
DOI: 10.1017/s0963548306007905
|View full text |Cite
|
Sign up to set email alerts
|

The Application of Non-Crossing Partitions to Improving Percolation Threshold Bounds

Abstract: We describe how non-crossing partitions arise in substitution method calculations. By using efficient algorithms for computing non-crossing partitions we are able to substantially reduce the computational effort, which enables us to compute improved bounds on the percolation thresholds for three percolation models. For the Kagomé bond model we improve bounds from 0.5182 p c 0.5335 to 0.522197 p c 0.526873, improving the range from 0.0153 to 0.004676. For the (3, 12 2 ) bond model we improve bounds from 0.7393 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
26
1

Year Published

2007
2007
2022
2022

Publication Types

Select...
5
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 10 publications
(27 citation statements)
references
References 18 publications
0
26
1
Order By: Relevance
“…There are a small number of recent, more accurate, rigorous results, including an intervals of width 0.00135 and 0.0046 for site percolation on the (3,12 2 ) and Kagomé lattices obtained by May and Wierman [20].…”
Section: Introductionmentioning
confidence: 99%
“…There are a small number of recent, more accurate, rigorous results, including an intervals of width 0.00135 and 0.0046 for site percolation on the (3,12 2 ) and Kagomé lattices obtained by May and Wierman [20].…”
Section: Introductionmentioning
confidence: 99%
“…The substitution method compares probabilities of connections between vertices in the percolation model on an unsolved lattice with those on a solved reference lattice. Previous attempts to disprove the Tsallis conjecture, by May and Wierman [17,18], used the hexagonal lattice bond model as the reference model, since the hexagonal lattice has some structural similarity with the kagome lattice. Since then, a class of new exact solutions has been established.…”
Section: The Latticesmentioning
confidence: 99%
“…We obtain mathematically rigorous bounds of 0.522394 < p c (kagome) < 0.526750, the electronic journal of combinatorics 22(2) (2015), #P2.52 which disprove the Tsallis conjecture by showing that in fact his value is strictly smaller than the kagome lattice bond percolation threshold. Note that the bounds are improvements of [18], and are approximately centered on the recent simulation estimates. Note also that, previous to the Tsallis conjecture, Wu [39] conjectured a percolation threshold of 0.524430 for the kagome lattice bond model.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations