Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userCritical frontier for the Potts and percolation models on triangular-type and kagome-type lattices II: Numerical analysis
356
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
In a recent paper (arXiv:0911.2514), one of us (FYW) considered the Potts model and bond and site percolation on two general classes of two-dimensional lattices, the triangular-type and kagome-type lattices, and obtained closed-form expressions for the critical frontier with applications to various lattice models. For the triangular-type lattices Wus result is exact, and for the kagome-type lattices Wus expression is under a homogeneity assumption. The purpose of the present paper is two-fold: First, an essential step in Wus analysis is the derivation of lattice-dependent constants $A, B, C$ for various lattice models, a process which can be tedious. We present here a derivation of these constants for subnet networks using a computer algorithm. Secondly, by means of a finite-size scaling analysis based on numerical transfer matrix calculations, we deduce critical properties and critical thresholds of various models and assess the accuracy of the homogeneity assumption. Specifically, we analyze the $q$-state Potts model and the bond percolation on the 3-12 and kagome-type subnet lattices $(ntimes n):(ntimes n)$, $nleq 4$, for which the exact solution is not known. To calibrate the accuracy of the finite-size procedure, we apply the same numerical analysis to models for which the exact critical frontiers are known. The comparison of numerical and exact results shows that our numerical determination of critical thresholds is accurate to 7 or 8 significant digits. This in turn infers that the homogeneity assumption determines critical frontiers with an accuracy of 5 decimal places or higher. Finally, we also obtained the exact percolation thresholds for site percolation on kagome-type subnet lattices $(1times 1):(ntimes n)$ for $1leq n leq 6$.
rate research
Read More
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 frontier 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.
On Archimedean lattices, the Ising model exhibits spontaneous ordering. Three examples of these lattices of the majority-vote model with noise are considered and studied through extensive Monte Carlo simulations. The order/disorder phase transition is observed in this system. The calculated values of the critical noise parameter are q_c=0.089(5), q_c=0.078(3), and q_c=0.114(2) for honeycomb, Kagome and triangular lattices, respectively. The critical exponents beta/nu, gamma/nu and 1/nu for this model are 0.15(5), 1.64(5), and 0.87(5); 0.14(3), 1.64(3), and 0.86(6); 0.12(4), 1.59(5), and 1.08(6) for honeycomb, Kagome and triangular lattices, respectively. These results differs from the usual Ising model results and the majority-vote model on so-far studied regular lattices or complex networks. The effective dimensionalities of the system D_{eff}= 1.96(5) (honeycomb), D_{eff} =1.92(4) (Kagome), and D_{eff}= 1.83(5) (triangular) for these networks are just compatible to the embedding dimension two.
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 curve 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).
Using Monte Carlo simulations and finite-size scaling analysis, the critical behavior of self-assembled rigid rods on triangular and honeycomb lattices at intermediate density has been studied. The system is composed of monomers with two attractive (sticky) poles that, by decreasing temperature or increasing density, polymerize reversibly into chains with three allowed directions and, at the same time, undergo a continuous isotropic-nematic (IN) transition. The determination of the critical exponents, along with the behavior of Binder cumulants, indicate that the IN transition belongs to the q=1 Potts universality class.
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}.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
