اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدInterface tension of the 3d 4-state Potts model using the Wang-Landau algorithm
74
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study the interface tension of the 4-state Potts model in three dimensions using the Wang- Landau algorithm. The interface tension is given by the ratio of the partition function with a twisted boundary condition in one direction and periodic boundary conditions in all other directions over the partition function with periodic boundary conditions in all directions. With the Wang-Landau algorithm we can explicitly calculate both partition functions and obtain the result for all temperatures. We find solid numerical evidence for perfect wetting. Our algorithm is tested by calculating thermodynamic quantities at the phase transition point.
قيم البحث
اقرأ أيضاً
Monte Carlo simulations using the newly proposed Wang-Landau algorithm together with the broad histogram relation are performed to study the antiferromagnetic six-state clock model on the triangular lattice, which is fully frustrated. We confirm the
existence of the magnetic ordering belonging to the Kosterlitz-Thouless (KT) type phase transition followed by the chiral ordering which occurs at slightly higher temperature. We also observe the lower temperature phase transition of KT type due to the discrete symmetry of the clock model. By using finite-size scaling analysis, the higher KT temperature $T_2$ and the chiral critical temperature $T_c$ are respectively estimated as $T_2=0.5154(8)$ and $T_c=0.5194(4)$. The results are in favor of the double transition scenario. The lower KT temperature is estimated as $T_1=0.496(2)$. Two decay exponents of KT transitions corresponding to higher and lower temperatures are respectively estimated as $eta_2=0.25(1)$ and $eta_1=0.13(1)$, which suggests that the exponents associated with the KT transitions are universal even for the frustrated model.
We analyze the convergence properties of the Wang-Landau algorithm. This sampling method belongs to the general class of adaptive importance sampling strategies which use the free energy along a chosen reaction coordinate as a bias. Such algorithms a
re very helpful to enhance the sampling properties of Markov Chain Monte Carlo algorithms, when the dynamics is metastable. We prove the convergence of the Wang-Landau algorithm and an associated central limit theorem.
We implement a two-stage approach of the Wang-Landau algorithm to investigate the critical properties of the 3D Ising model with quenched bond randomness. In particular, we consider the case where disorder couples to the nearest-neighbor ferromagneti
c interaction, in terms of a bimodal distribution of strong versus weak bonds. Our simulations are carried out for large ensembles of disorder realizations and lattices with linear sizes $L$ in the range $L=8-64$. We apply well-established finite-size scaling techniques and concepts from the scaling theory of disordered systems to describe the nature of the phase transition of the disordered model, departing gradually from the fixed point of the pure system. Our analysis (based on the determination of the critical exponents) shows that the 3D random-bond Ising model belongs to the same universality class with the site- and bond-dilution models, providing a single universality class for the 3D Ising model with these three types of quenched uncorrelated disorder.
We present preliminary results of the investigation of the properties of the Markov random walk in the energy space generated by the Wang-Landau probability. We build transition matrix in the energy space (TMES) using the exact density of states for
one-dimensional and two-dimensional Ising models. The spectral gap of TMES is inversely proportional to the mixing time of the Markov chain. We estimate numerically the dependence of the mixing time on the lattice size, and extract the mixing exponent.
We propose a strategy to achieve the fastest convergence in the Wang-Landau algorithm with varying modification factors. With this strategy, the convergence of a simulation is at least as good as the conventional Monte Carlo algorithm, i.e. the stati
stical error vanishes as $1/sqrt{t}$, where $t$ is a normalized time of the simulation. However, we also prove that the error cannot vanish faster than $1/t$. Our findings are consistent with the $1/t$ Wang-Landau algorithm discovered recently, and we argue that one needs external information in the simulation to beat the conventional Monte Carlo algorithm.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
