Using Symmetry to Improve Percolation Threshold Bounds

2005/07/01 by WILLIAM D. MAY, JOHN C. WIERMAN

paper · doi:10.1017/s0963548305006802

Abstract

We show that symmetry, represented by a graph's automorphism group, can be used to greatly reduce the computational work for the substitution method. This allows application of the substitution method over larger regions of the problem lattices, resulting in tighter bounds on the percolation threshold p_c . We demonstrate the symmetry reduction technique using bond percolation on the (3,12²) lattice, where we improve the bounds on p_c from (0.738598,0.744900) to (0.739399,0.741757), a reduction of more than 62% in width, from 0.006302 to 0.002358.

Related

• The Application of Non-Crossing Partitions to Improving Percolation Threshold Bounds
• Generalized cell/dual-cell transformation for percolation, and new exact thresholds
• Square-lattice site percolation at increasing ranges of neighbor bonds
• Transfer matrix computation of generalised critical polynomials in percolation
• Site percolation thresholds and universal formulas for the Archimedean lattices