Related papers: A Cluster Method for the Ashkin--Teller Model
A new Monte Carlo algorithm for 2-dimensional spin glasses is presented. The use of clusters makes possible global updates and leads to a gain in speed of several orders of magnitude. As an example, we study the 2-dimensional +/-J…
We present a detailed description of the idea and procedure for the newly proposed Monte Carlo algorithm of tuning the critical point automatically, which is called the probability-changing cluster (PCC) algorithm [Y. Tomita and Y. Okabe,…
We review the local Monte Carlo dynamics and Swendsen-Wang cluster algorithm. We introduce and analyze a new Monte Carlo dynamics known as transitional Monte Carlo. The transitional Monte Carlo algorithm samples energy probability…
The spatial rock-scissors-paper game (or cyclic Lotka-Volterra system) is extended to study how the spatiotemporal patterns are affected by the constructed backgrounds providing uniform number of neighbors (degree) at each site. On the…
We consider the Ashkin-Teller model on the square lattice, which is represented by two Ising models ($\sigma$ and $\tau$) having a four-spin coupling of strength, $\epsilon$, between them. We introduce an asymmetric defect line in the…
Critical scaling and universality in short-time dynamics for spin models on a two-dimensional triangular lattice are investigated by using Monte Carlo simulation. Emphasis is placed on the dynamic evolution from fully ordered initialstates…
Monte Carlo algorithms, like the Swendsen-Wang and invaded-cluster, sample the Ising and Potts models asymptotically faster than single-spin Glauber dynamics do. Here, we generalize both algorithms to sample Potts lattice gauge theory by…
The critical behavior of two-dimensional (2D) anisotropic systems with weak quenched disorder described by the so-called generalized Ashkin-Teller model (GATM) is studied. In the critical region this model is shown to be described by a…
We use the single-cluster Monte Carlo update algorithm to simulate the Ising model on two-dimensional Poissonian random lattices with up to 80,000 sites which are linked together according to the Voronoi/Delaunay prescription. In one set of…
We propose a highly efficient "worm" like cluster Monte Carlo algorithm for the quantum rotor model in the link-current representation. We explicitly prove detailed balance for the new algorithm even in the presence of disorder. For the…
We study the dynamic critical behavior of the multi-grid Monte Carlo (MGMC) algorithm with piecewise-constant interpolation and a W-cycle, applied to the one-dimensional $O(4)$-symmetric nonlinear $\sigma$-model [= $SU(2)$ principal chiral…
The principle and the efficiency of the Monte Carlo transfer-matrix algorithm are discussed. Enhancements of this algorithm are illustrated by applications to several phase transitions in lattice spin models. We demonstrate how the…
Recently a cluster Monte Carlo algorithm has been used very successfully in the two-dimensional Edwards-Anderson (EA) model. We show that this algorithm and a variant thereof can also be used successfully in models with a non-zero spin…
The dynamic process for the two dimensional three state Potts model in the critical domain is simulated by the Monte Carlo method. It is shown that the critical point can rigorously be located from the universal short-time behaviour. This…
Critical behaviour of a system, subjected to strongly anisotropic turbulent mixing, is studied by means of the field theoretic renormalization group. Specifically, relaxational stochastic dynamics of a non-conserved multicomponent order…
The Motsch-Tadmor (MT) model is a variant of the Cucker-Smale model with a normalized communication weight function. The normalization poses technical challenges in analyzing the collective behavior due to the absence of conservation of…
Given a set of variables and the correlations among them, we develop a method for finding clustering among the variables. The method takes advantage of information implicit in higher-order (not just pairwise) correlations. The idea is to…
We study the geometric properties of a system initially in equilibrium at a critical point that is suddenly quenched to another critical point and subsequently evolves towards the new equilibrium state. We focus on the bidimensional Ising…
We describe a novel switching algorithm based on a ``reverse'' Monte Carlo method, in which the potential is stochastically modified before the system configuration is moved. This new algorithm facilitates a generalized formulation of…
We study two generalizations of classic clustering problems called dynamic ordered $k$-median and dynamic $k$-supplier, where the points that need clustering evolve over time, and we are allowed to move the cluster centers between…