pith. sign in

arxiv: 0910.4340 · v1 · pith:LR6Q7C3Knew · submitted 2009-10-22 · ❄️ cond-mat.stat-mech

Comment on `Monte Carlo simulation study of the two-stage percolation transition in enhanced binary trees'

classification ❄️ cond-mat.stat-mech
keywords binarycarloenhancedgraphhyperboliclatticesmonteoverline
0
0 comments X
read the original abstract

The enhanced binary tree (EBT) is a nontransitive graph which has two percolation thresholds $p_{c1}$ and $p_{c2}$ with $p_{c1}<p_{c2}$. Our Monte Carlo study implies that the second threshold $p_{c2}$ is significantly lower than a recent claim by Nogawa and Hasegawa (J. Phys. A: Math. Theor. {\bf 42} (2009) 145001). This means that $p_{c2}$ for the EBT does not obey the duality relation for the thresholds of dual graphs $p_{c2}+\overline{p}_{c1}=1$ which is a property of a transitive, nonamenable, planar graph with one end. As in regular hyperbolic lattices, this relation instead becomes an inequality $p_{c2}+\overline{p}_{c1}<1$. We also find that the critical behavior is well described by the scaling form previously found for regular hyperbolic lattices.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.