اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدHigh-precision percolation thresholds and Potts-model critical manifolds from graph polynomials
112
0
0.0
(
0
)
تأليف
Jesper Lykke Jacobsen
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The critical curves of the q-state Potts model can be determined exactly for regular two-dimensional lattices G that are of the three-terminal type. Jacobsen and Scullard have defined a graph polynomial P_B(q,v) that gives access to the critical manifold for general lattices. It depends on a finite repeating part of the lattice, called the basis B, and its real roots in the temperature variable v = e^K - 1 provide increasingly accurate approximations to the critical manifolds upon increasing the size of B. These authors computed P_B(q,v) for large bases (up to 243 edges), obtaining determinations of the ferromagnetic critical point v_c > 0 for the (4,8^2), kagome, and (3,12^2) lattices to a precision (of the order 10^{-8}) slightly superior to that of the best available Monte Carlo simulations. In this paper we describe a more efficient transfer matrix approach to the computation of P_B(q,v) that relies on a formulation within the periodic Temperley-Lieb algebra. This makes possible computations for substantially larger bases (up to 882 edges), and the precision on v_c is hence taken to the range 10^{-13}. We further show that a large variety of regular lattices can be cast in a form suitable for this approach. This includes all Archimedean lattices, their duals and their medials. For all these lattices we tabulate high-precision estimates of the bond percolation thresholds p_c and Potts critical points v_c. We also trace and discuss the full Potts critical manifold in the (q,v) plane, paying special attention to the antiferromagnetic region v < 0. Finally, we adapt the technique to site percolation as well, and compute the polynomials P_B(p) for certain Archimedean and dual lattices (those having only cubic and quartic vertices), using very large bases (up to 243 vertices). This produces the site percolation thresholds p_c to a precision of the order 10^{-9}.
قيم البحث
اقرأ أيضاً
Any two-dimensional infinite regular lattice G can be produced by tiling the plane with a finite subgraph B of G; we call B a basis of G. We introduce a two-parameter graph polynomial P_B(q,v) that depends on B and its embedding in G. The algebraic c
urve P_B(q,v) = 0 is shown to provide an approximation to the critical manifold of the q-state Potts model, with coupling v = exp(K)-1, defined on G. This curve predicts the phase diagram both in the ferromagnetic (v>0) and antiferromagnetic (v<0) regions. For larger bases B the approximations become increasingly accurate, and we conjecture that P_B(q,v) = 0 provides the exact critical manifold in the limit of infinite B. Furthermore, for some lattices G, or for the Ising model (q=2) on any G, P_B(q,v) factorises for any choice of B: the zero set of the recurrent factor then provides the exact critical manifold. In this sense, the computation of P_B(q,v) can be used to detect exact solvability of the Potts model on G. We illustrate the method for the square lattice, where the Potts model has been exactly solved, and the kagome lattice, where it has not. For the square lattice we correctly reproduce the known phase diagram, including the antiferromagnetic transition and the singularities in the Berker-Kadanoff phase. For the kagome lattice, taking the smallest basis with six edges we recover a well-known (but now refuted) conjecture of F.Y. Wu. Larger bases provide successive improvements on this formula, giving a natural extension of Wus approach. The polynomial predictions are in excellent agreement with numerical computations. For v>0 the accuracy of the predicted critical coupling v_c is of the order 10^{-4} or 10^{-5} for the 6-edge basis, and improves to 10^{-6} or 10^{-7} for the largest basis studied (with 36 edges).
We consider the Potts model and the related bond, site, and mixed site-bond percolation problems on triangular-type and kagome-type lattices, and derive closed-form expressions for the critical frontier. For triangular-type lattices the critical fron
tier is known, usually derived from a duality consideration in conjunction with the assumption of a unique transition. Our analysis, however, is rigorous and based on an established result without the need of a uniqueness assumption, thus firmly establishing all derived results. For kagome-type lattices the exact critical frontier is not known. We derive a closed-form expression for the Potts critical frontier by making use of a homogeneity assumption. The closed-form expression is new, and we apply it to a host of problems including site, bond, and mixed site-bond percolation on various lattices. It yields exact thresholds for site percolation on kagome, martini, and other lattices, and is highly accurate numerically in other applications when compared to numerical determination.
The two-dimensional Potts model can be studied either in terms of the original Q-component spins, or in the geometrical reformulation via Fortuin-Kasteleyn (FK) clusters. While the FK representation makes sense for arbitrary real values of Q by const
ruction, it was only shown very recently that the spin representation can be promoted to the same level of generality. In this paper we show how to define the Potts model in terms of observables that simultaneously keep track of the spin and FK degrees of freedom. This is first done algebraically in terms of a transfer matrix that couples three different representations of a partition algebra. Using this, one can study correlation functions involving any given number of propagating spin clusters with prescribed colours, each of which contains any given number of distinct FK clusters. For 0 <= Q <= 4 the corresponding critical exponents are all of the Kac form h_{r,s}, with integer indices r,s that we determine exactly both in the bulk and in the bounda
In previous work with Scullard, we defined a graph polynomial P_B(q,T) that gives access to the critical temperature T_c of the q-state Potts model on a general two-dimensional lattice L. It depends on a basis B, containing n x m unit cells of L, and
the relevant root of P_B(q,T) was observed to converge quickly to T_c in the limit n,m to infinity. Moreover, in exactly solvable cases there is no finite-size dependence at all. We reformulate this method as an eigenvalue problem within the periodic Temperley-Lieb algebra. This corresponds to taking m to infinity first, so the bases B are semi-infinite cylinders of circumference n. The limit implies faster convergence in n, while maintaining the n-independence in exactly solvable cases. In this setup, T_c(n) is determined by equating the largest eigenvalues of two topologically distinct sectors of the transfer matrix. Crucially, these two sectors determine the same critical exponent in the continuum limit, and the observed fast convergence is thus corroborated by results of conformal field theory. We obtain similar results for the dense and dilute phases of the O(N) loop model, using now a transfer matrix within the dilute periodic Temperley-Lieb algebra. The eigenvalue formulation allows us to double the size n for which T_c(n) can be obtained, using the same computational effort. We study in details three significant cases: (i) bond percolation on the kagome lattice, up to n = 14; (ii) site percolation on the square lattice, to n = 21; and (iii) self-avoiding polygons on the square lattice, to n = 19. Convergence properties of T_c(n) and extrapolation schemes are studied in details for the first two cases. This leads to rather accurate values for the percolation thresholds: p_c = 0.524404999167439(4) for bond percolation on the kagome lattice, and p_c = 0.59274605079210(2) for site percolation on the square lattice.
In the paper random-site percolation thresholds for simple cubic lattice with sites neighborhoods containing next-next-next-nearest neighbors (4NN) are evaluated with Monte Carlo simulations. A recently proposed algorithm with low sampling for percol
ation thresholds estimation [Bastas et al., arXiv:1411.5834] is implemented for the studies of the top-bottom wrapping probability. The obtained percolation thresholds are $p_C(text{4NN})=0.31160(12)$, $p_C(text{4NN+NN})=0.15040(12)$, $p_C(text{4NN+2NN})=0.15950(12)$, $p_C(text{4NN+3NN})=0.20490(12)$, $p_C(text{4NN+2NN+NN})=0.11440(12)$, $p_C(text{4NN+3NN+NN})=0.11920(12)$, $p_C(text{4NN+3NN+2NN})=0.11330(12)$, $p_C(text{4NN+3NN+2NN+NN})=0.10000(12)$, where 3NN, 2NN, NN stands for next-next-nearest neighbors, next-nearest neighbors, and nearest neighbors, respectively. As an SC lattice with 4NN neighbors may be mapped onto two independent interpenetrated SC lattices but with two times larger lattice constant the percolation threshold $p_C$(4NN) is exactly equal to $p_C$(NN). The simplified Bastas et al. method allows for reaching uncertainty of the percolation threshold value $p_C$ similar to those obtained with classical method but ten times faster.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
