Related papers: A Cluster Method for the Ashkin--Teller Model
The critical behaviour of a bond-disordered Ashkin-Teller model on a square lattice is investigated by intensive Monte-Carlo simulations. A duality transformation is used to locate a critical plane of the disordered model. This critical…
We investigate the symmetric Ashkin-Teller (AT) model on the triangular lattice in the antiferromagnetic two-spin coupling region ($J<0$). In the $J \rightarrow -\infty$ limit, we map the AT model onto a fully-packed loop-dimer model on the…
We study the dynamic critical behavior of a Swendsen--Wang--type algorithm for the Ashkin--Teller model. We find that the Li--Sokal bound on the autocorrelation time ($\tau_{{\rm int},{\cal E}} \ge {\rm const} \times C_H$) holds along the…
We use Monte Carlo simulations and tensor network methods to study a classical monomer-dimer model on the square lattice with a hole (monomer) fugacity $z$, an aligning dimer-dimer interaction $u$ that favors columnar order, and an…
Motivated by recent progress on the scaling behavior of entanglement entropy, we study the scaling behavior of the number of clusters crossing the boundary between two subsystems for several classical statistical models in two dimension.…
The Ashkin-Teller (AT) model is a classic spin model in statistical mechanics. For traditional homogeneous lattices like triangular and kagome lattices, even when frustration exists, the model only has one ferromagnetic-paramagnetic…
We investigate the short-time universal behavior of the two dimensional Ashkin-Teller model at the Baxter line by performing time-dependent Monte Carlo Simulations. First, as preparatory results, we obtain the critical parameters by…
Many spin systems affected by critical slowing down can be efficiently simulated using cluster algorithms. Where such systems have long-range interactions, suitable formulations can additionally bring down the computational effort for each…
We study the dynamic critical behavior of two algorithms: the Swendsen-Wang algorithm for the two-dimensional Potts model with q=2,3,4 and a Swendsen-Wang-type algorithm for the two-dimensional symmetric Ashkin-Teller model on the self-dual…
Dynamical behavior of the clusters during relaxation is studied in two-dimensional Potts model using cluster algorithm. Average cluster size and cluster formation velocity are calculated on two different lattice sizes for different number…
We prove an inequality on decision trees on monotonic measures which generalizes the OSSS inequality on product spaces. As an application, we use this inequality to prove a number of new results on lattice spin models and their…
We propose numerical simulations of the Ashkin-Teller model as a foil for theoretical techniques for studying very weakly first-order phase transitions in three dimensions. The Ashkin-Teller model is a simple two-spin model whose parameters…
We propose a new effective cluster algorithm of tuning the critical point automatically, which is an extended version of Swendsen-Wang algorithm. We change the probability of connecting spins of the same type, $p = 1 - e^{- J/ k_BT}$, in…
We study, via Monte Carlo simulation, the dynamic critical behavior of the Chayes-Machta dynamics for the Fortuin-Kasteleyn random-cluster model, which generalizes the Swendsen-Wang dynamics for the q-state Potts ferromagnet to non-integer…
We study the dynamic critical behavior of the Chayes-Machta dynamics for the Fortuin-Kasteleyn random-cluster model, which generalizes the Swendsen-Wang dynamics for the q-state Potts model to noninteger q, in two and three spatial…
We present cluster Monte Carlo algorithms for the $XYZ$ quantum spin models. In the special case of $S=1/2$, the new algorithm can be viewed as a cluster algorithm for the 8-vertex model. As an example, we study the $S=1/2$ $XY$ model in…
We study the dynamic critical behavior of the multi-grid Monte Carlo (MGMC) algorithm with piecewise-constant interpolation applied to the two-dimensional O(4)-symmetric nonlinear $\sigma$-model [= SU(2) principal chiral model], on lattices…
Cluster Monte Carlo algorithms are widely regarded as the most effective route to overcoming critical slowing down in lattice spin systems. Whether this acceleration persists in the presence of vacancies and multicritical fluctuations,…
We study the O(N) loop model on the Honeycomb lattice with real value $N \geq 1$ by means of a cluster algorithm. The formulation of the algorithm is based on the equivalence of the O(N) loop model and the low-temperature graphical…
We consider a 3-dimensional lattice model of a network-forming fluid, which has been recently investigated by Girardi and coworkers by means of Monte Carlo simulations [J. Chem. Phys. \textbf{126}, 064503 (2007)], with the aim of describing…