Related papers: Cluster algorithms for frustrated two dimensional …
We present an optimized version of a cluster labeling algorithm previously introduced by the authors. This algorithm is well suited for large-scale Monte Carlo simulations of spin models using cluster dynamics on parallel computers with…
A new approximation hierarchy, called the LPSUB$m$ scheme, is described for the coupled cluster method (CCM). It is applicable to systems defined on a regular spatial lattice. We then apply it to two well-studied prototypical (spin-1/2…
Trilayered, Ising, spin-1/2, ferrimagnets are an interesting subject for simulational studies for they show compensation effect. A Monte Carlo study on such a system with sublayers on triangular lattice is performed in the current work.…
We implement a cluster-update Monte Carlo algorithm to simulate magnetic dipoles of the XY-spin type confined in a two-dimensional plane. The long-range character and anisotropy in the dipole interaction are handled by using the…
Using a combinatorial method, the partition functions for two-dimensional nearest neighbour Ising models have been derived for a square lattice of 16 sites in the presence of the magnetic field. A novel hierarchical method of enumeration of…
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 discuss the development of cluster algorithms from the viewpoint of probability theory and not from the usual viewpoint of a particular model. By using the perspective of probability theory, we detail the nature of a cluster algorithm,…
We report lattice simulations of $\phi^4_2$ and $O(N)\,\phi^4$ models, performed by means of a Monte Carlo method based on the all-order strong coupling expansion (worm algorithm). The investigation of the non-perturbative features of the…
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 collective behavior of interacting magnetic moments can be strongly influenced by the topology of the underlying lattice. In geometrically frustrated spin systems, interesting chiral correlations may develop that are related to the spin…
We propose an algorithm to obtain numerically approximate solutions of the direct Ising problem, that is, to compute the free energy and the equilibrium observables of spin systems with arbitrary two-spin interactions. To this purpose we…
Lattice-coupled antiferromagnetic spin model is analyzed for a number of frustrated lattices: triangular, Kagome, and pyrochlore. In triangular and Kagome lattices where ground state spins are locally ordered, the spin-lattice interaction…
Extensive Monte Carlo simulations in the semi-grand-canonical ensemble are used to study the critical behavior of a three-dimensional compressible Ising model with antiferromagnetic interactions under constant volume conditions. Elastic…
On directed lattices, with half as many neighbours as in the usual undirected lattices, the Ising model does not seem to show a spontaneous magnetisation, at least for lower dimensions. Instead, the decay time for flipping of the…
We use the coupled cluster method (CCM) to study the ground-state properties and lowest-lying triplet excited state of the spin-half {\it XXZ} antiferromagnet on the square lattice. The CCM is applied to it to high orders of approximation…
The random field Ising model with Gaussian disorder is studied using a new Monte Carlo algorithm. The algorithm combines the advantanges of the replica exchange method and the two-replica cluster method and is much more efficient than the…
The dynamic critical behavior of the two-replica cluster algorithm is studied. Several versions of the algorithm are applied to the two-dimensional, square lattice Ising model with a staggered field. The dynamic exponent for the full…
An efficient Monte Carlo algorithm for the simulation of spin models with long-range interactions is discussed. Its central feature is that the number of operations required to flip a spin is independent of the number of interactions…
The two-dimensional Ising model is studied by performing computer simulations with one of the Monte Carlo algorithms - the worm algorithm. The critical temperature T_C of the phase transition is calculated by the usage of the critical…
Continuous symmetries are believed to emerge at many quantum critical points in frustrated magnets. In this work, we study two candidates of this paradigm: the transverse-field frustrated Ising model (TFFIM) on the triangle and the…