Related papers: Cluster mechanisms in the fully frustrated Ising m…
We show that the two dimensional Ising model is complete, in the sense that the partition function of any lattice model on any graph is equal to the partition function of the 2D Ising model with complex coupling. The latter model has all…
The Fortuin-Kasteleyn mapping between the Ising model and the site-bond correlated percolation model is shown to be only one of an infinite class of exact mappings. These new cluster representations are a result of "renormalized"…
We consider discrete spin models on arbitrary planar graphs and lattices with frustrated interactions. We first analyze the Ising model with frustrated plaquettes. We use an algebraic approach to derive the result that an Ising model with…
The community structure of complex networks reveals both their organization and hidden relationships among their constituents. Most community detection methods currently available are not deterministic, and their results typically depend on…
Mixture models extend the toolbox of clustering methods available to the data analyst. They allow for an explicit definition of the cluster shapes and structure within a probabilistic framework and exploit estimation and inference…
We study the phase diagram of a class of models in which a generalized cluster interaction can be quenched by Ising exchange interaction and external magnetic field. We characterize the various phases through winding numbers. They may be…
Cluster algorithms for classical and quantum spin systems are discussed. In particular, the cluster algorithm is applied to classical O(N) lattice actions containing interactions of more than two spins. The performance of the multi-cluster…
We simulated the fourier transform of the correlation function of the Ising model in two and three dimensions using a single cluster algorithm with improved estimators. The simulations are in agreement with series expansion and the…
The study of the Ising model from a percolation perspective has played a significant role in the modern theory of critical phenomena. We consider the celebrated square-lattice Ising model and construct percolation clusters by placing bonds,…
In this paper, we present a cluster algorithm for the simulation of hard spheres and related systems. In this algorithm, a copy of the configuration is rotated with respect to a randomly chosen pivot point. The two systems are then…
We present an extensive analysis of systematic deviations in Wolff cluster simulations of the critical Ising model, using random numbers generated by binary shift registers. We investigate how these deviations depend on the lattice size,…
Clustering is one of the most common unsupervised learning tasks in machine learning and data mining. Clustering algorithms have been used in a plethora of applications across several scientific fields. However, there has been limited…
A cluster mean-field method is introduced and the applications to the Ising and Heisenberg models are demonstrated. We divide the lattice sites into clusters whose size and shape are selected so that the equivalence of all sites in a…
It is proposed that the $O(n)$ spin and geometrical percolation models can help to study the QCD phase diagram due to the universality properties of the phase transition. In this paper, correlations and fluctuations of various sizes of…
The exact solution of the Ising model on the complete graph (CG) provides an important, though mean-field, insight for the theory of continuous phase transitions. Besides the original spin, the Ising model can be formulated in the…
Using D-theory we construct a new efficient cluster algorithm for the Ising model. The construction is very different from the standard Swendsen-Wang algorithm and related to worm algorithms. With the new algorithm we have measured the…
The invaded cluster algorithm, a new method for simulating phase transitions, is described in detail. Theoretical, albeit nonrigorous, justification of the method is presented and the algorithm is applied to Potts models in two and three…
The problem of N interacting spins on a lattice is equivalent to one of N clusters linked in a specific manner. The energy of any configuration of spins can be expressed in terms of the energy levels of this cluster. A new expression is…
We analyze the fragmentation behavior of random clusters on the lattice under a process where bonds between neighboring sites are successively broken. Modeling such structures by configurations of a generalized Potts or random-cluster model…
We study a Hamiltonian system describing a three-spin-1/2 cluster-like interaction competing with an Ising-like anti-ferromagnetic interaction. We compute free energy, spin correlation functions and entanglement both in the ground and in…