加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本