Abstract

We derive the critical nearest-neighbor connectivity gng_n as 3/43/4, 3(7−9pctri)/[4(5−4pctri)]3(7-9p_c^{tri})/[4(5-4p_c^{tri})], and 3(2+7pctri)/[4(5−pctri)]3(2+7p_c^{tri})/[4(5-p_c^{tri})] for bond percolation on the square, honeycomb and triangular lattice respectively, where pctri=2sin⁡(π/18)p_c^{tri}=2\sin(π/18) is the percolation threshold for the triangular lattice; and confirm these values via Monte Carlo simulations. On the square lattice, we also numerically determine the critical next-nearest-neighbor connectivity as gnn=0.687  500  0(2)g_{nn}=0.687\;500\;0(2), which confirms a conjecture by Mitra and Nienhuis in J. Stat. Mech. P10006 (2004), implying the exact value gnn=11/16g_{nn}=11/16. We also determine the connectivity on a free surface as gnsurf=0.625  000  1(13)g_n^{surf}=0.625\;000\;1(13) and conjecture that this value is exactly equal to 5/85/8. In addition, we find that at criticality, the connectivities depend on the linear finite size L as ∼Lyt−d\sim L^{y_t-d}, and the associated specific-heat-like quantities CnC_n and CnnC_{nn} scale as ∼L2yt−dln⁡(L/L0)\sim L^{2y_t-d} \ln (L/L_0), where dd is the lattice dimensionality, yt=1/νy_t=1/ν the thermal renormalization exponent, and L0L_0 a non-universal constant. We provide an explanation of this logarithmic factor in the theoretical framework reported recently by Vasseur et al. in J. Stat. Mech. L07001 (2012).

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.