Abstract
The enhanced binary tree (EBT) is a nontransitive graph which has two percolation thresholds and with . Our Monte Carlo study implies that the second threshold is significantly lower than a recent claim by Nogawa and Hasegawa (J. Phys. A: Math. Theor. {\bf 42} (2009) 145001). This means that 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.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.