Seung Ki Baek et al 2009 J. Phys. A: Math. Theor. 42 478001 doi:10.1088/1751-8113/42/47/478001
Seung Ki Baek1, Petter Minnhagen1 and Beom Jun Kim2
Show affiliationsThe enhanced binary tree (EBT) is a nontransitive graph which has two percolation thresholds pc1 and pc2 with pc1 < pc2. Our Monte Carlo study implies that the second threshold pc2 is significantly lower than a recent claim by Nogawa and Hasegawa (2009 J. Phys. A: Math. Theor. 42 145001). This means that pc2 for the EBT does not obey the duality relation for the thresholds of dual graphs
which is a property of a transitive, nonamenable, planar graph with one end. As in regular hyperbolic lattices, this relation instead becomes an inequality
. We also find that the critical behavior is well described by the scaling form previously found for regular hyperbolic lattices.
05.50.+q Lattice theory and statistics (Ising, Potts, etc.)
82B26 Phase transitions (general)
82B43 Percolation (See also 60K35)
82B80 Numerical methods (Monte Carlo, series resummation, etc.) (See also 65-XX, 81T80)
Issue 47 (27 November 2009)
Received 8 May 2009
Published 4 November 2009
Seung Ki Baek et al 2009 J. Phys. A: Math. Theor. 42 478001
Somendra M Bhattacharjee 2007 J. Phys. A: Math. Theor. 40 1703
H De Bie and F Sommen 2007 J. Phys. A: Math. Theor. 40 10441
Minoru Eto et al 2006 J. Phys. A: Math. Gen. 39 R315
M J Davis and P B Blakie 2005 J. Phys. A: Math. Gen. 38 10259
Tasrief Surungan et al 2004 J. Phys. A: Math. Gen. 37 4219
Man Hoi Lee 2001 J. Phys. A: Math. Gen. 34 10219
George Horton et al 2000 J. Phys. A: Math. Gen. 33 7337
Sutapa Mukherji et al 1996 J. Phys. A: Math. Gen. 29 L115
S Mukherji and S M Bhattacharjee 1993 J. Phys. A: Math. Gen. 26 L1139