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

preprint2009arXivOpen access

Abstract

The enhanced binary tree (EBT) is a nontransitive graph which has two percolation thresholds pc1p_{c1} and pc2p_{c2} with pc1<pc2p_{c1}<p_{c2}. Our Monte Carlo study implies that the second threshold pc2p_{c2} is significantly lower than a recent claim by Nogawa and Hasegawa (J. Phys. A: Math. Theor. {\bf 42} (2009) 145001). This means that pc2p_{c2} for the EBT does not obey the duality relation for the thresholds of dual graphs pc2+p‾c1=1p_{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 pc2+p‾c1<1p_{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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.