The application of non-crossing partitions to improving percolation threshold bounds

Combinatorics Probability and Computing

Volumn 16, Issue 2, 2007, Pages 285-307

  May, William D ^a   Wierman, John C ^a  

^a Johns Hopkins University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; MATHEMATICAL INSTRUMENTS; PERCOLATION (COMPUTER STORAGE);

BOND MODEL; PERCOLATION MODELS; PERCOLATION THRESHOLDS; THRESHOLD BOUNDS; UPPER BOUND;

BOUNDARY CONDITIONS;

EID: 33847099558     PISSN: 09635483     EISSN: 14692163     Source Type: Journal    
DOI: 10.1017/S0963548306007905     Document Type: Article

References (19)

1. Ahuja, R. K., Magnanti, T. L. and Orlin, J. B. (1993) Network Flows: Theory, Algorithms and Applications, Prentice-Hall, New Jersey.
2. Edelman, P. H. (1982) Multichains, non-crossing partitions and trees. Discrete Math. 40 171-179.
3. Grimmett, G. (1999) Percolation, 2nd edn, Springer, Berlin.
4. Hughes, B. D. (1996) Random Walks and Random Environments, Vol: 2: Random Environments, Oxford University Press, Oxford.
5. Kerber, A. (1999) Applied Finite Group Actions, 2nd edn, Springer, Berlin.
6. Kreweras, G. (1972) Sur les partitions non croisées d'un cycle. Discrete Math, 1 333-350.
7. Luczak, T. and Wierman, J. C. (1988) Critical probability bounds for two-dimensional site percolation models. J. Phys. A: Math. Gen. 21 3131-3138.
8. May, W. D. and Wierman, J. C. (2006) Algorithms for non-crossing partitions. Technical Report 654, Johns Hopkins University, Department of Applied Mathematics and Statistics. To appear in Congressus Numerantium.
9. May, W. D. and Wierman, J. C. (2005) Using symmetry to improve percolation threshold bounds. Combin. Probab. Comput. 14 549-566.
10. Parviainen, R. (2004) Connectivity properties of Archimedean and Laves lattices. PhD thesis, Uppsala University.
11. Preston, C. J. (1974) A generalization of the FKG inequalities. Comm. Math. Phys. 36 233-241.
12. Tsallis, C. (1982) Phase diagram of anisotropic planar Potts ferromagnets: A new conjecture. J. Phys. C: Solid State Physics 15 L757-L764.
13. van den Berg, J. and Ermakov, A. (1996) A new lower bound for the critical probability of site percolation on the square lattice. Random Struct. Alg. 8 199-212.
14. Wierman, J. C. (1981) Bond percolation on honeycomb and triangular lattices. Adv. Appl. Probab. 13 298-313.
15. Wierman, J. C. (1989) Bond percolation critical probability bounds for the Kagomé lattice by a substitution method. In Disorder in Physical Systems (G. Grimmett and D. J. A. Welsh, eds), Oxford University Press, pp. 349-360.
16. Wierman, J. C. (2002) Bond percolation critical probability bounds for three Archimedean lattices. Random Struct. Alg. 20 508-518.
17. Wierman, J. C. (2002) An improved upper bound for the hexagonal lattice site percolation critical probability. Combin. Probab. Comput. 11 629-643.
18. Wierman, J. C. (2003) Upper and lower bounds for the Kagomé lattice bond percolation critical probability. Combin. Probab. Comput. 12 95-111.
19. Wierman, J. C. and Naor, D. P. (2003) Desirable properties of universal formulas for percolation thresholds. Congressus Numerantium 163 125-142.