Related papers: A cluster algorithm for Potts models with fixed sp…
We present a new approach to clustering, based on the physical properties of an inhomogeneous ferromagnet. No assumption is made regarding the underlying distribution of the data. We assign a Potts spin to each data point and introduce an…
To identify emerging microscopic structures in low temperature spin glasses, we study self-sustained clusters (SSC) in spin models defined on sparse random graphs. A message-passing algorithm is developed to determine the probability of…
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…
A new cluster algorithm based on invasion percolation is described. The algorithm samples the critical point of a spin system without a priori knowledge of the critical temperature and provides an efficient way to determine the critical…
The geometrical critical behaviour of the two-dimensional Q-state Potts model is usually studied in terms of the Fortuin-Kasteleyn (FK) clusters, or their surrounding loops. In this paper we study a quite different geometrical object: the…
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…
We present a general strategy to extend quantum cluster algorithms for S=1/2 spin systems, such as the loop algorithm, to systems with arbitrary size of spins. In general, the partition function of a high-S spin system is represented in…
We study the low energy states of finite spin chains with isotropic (Heisenberg) and anisotropic (XY and Ising-like) exchange interaction with uniform and non-uniform coupling constants. We show that for an odd number of sites a spin…
We applied cluster density matrix embedding theory, with some modifications, to a spin lattice system. The reduced density matrix of the impurity cluster is embedded in the bath states, which are a set of block-product states. The ground…
A generalization of the microcanonical ensemble suggests a simple strategy for the simulation of first order phase transitions. At variance with flat-histogram methods, there is no iterative parameters optimization, nor long waits for…
We construct an efficient cluster algorithm for ferromagnetic SU(N)-symmetric quantum spin systems. Such systems provide a new regularization for CP(N-1) models in the framework of D-theory, which is an alternative non-perturbative approach…
Numerical simulations on the total mass, the numbers of bonds on the hull, external perimeter, singly connected bonds and gates into large fjords of the Fortuin-Kasteleyn clusters for two-dimensional q-state Potts models at criticality are…
An algorithm for Monte Carlo simulations is proposed in which the parameter controlling the strength of the transition becomes a dynamical variable and in which efficient transitions are achieved by cluster steps. It allows to avoid the…
We introduce a hybrid quantum-classical variational algorithm to simulate ground-state phase diagrams of frustrated quantum spin models in the thermodynamic limit. The method is based on a cluster-Gutzwiller ansatz where the wave function…
The clustering of companies within a specific stock market index is studied by means of super-paramagnetic transitions of an appropriate q-state Potts model where the spins correspond to companies and the interactions are functions of the…
The cactus approximation in the cluster variation method is applied to the spin ice system with nearest neighbor ferromagnetic coupling. The temperature dependences of the entropy and the specific heat show qualitatively good agreement with…
We investigate the spatial overlap of successive spin configurations in Markov chain Monte Carlo simulations using the local Metropolis algorithm and the Swendsen-Wang and Wolff cluster algorithms. We examine the dynamics of these…
The cluster algorithm in the fully frustrated Ising model on the square lattice is essentially different from the ones used in other systems. Thus its better understanding is particularly important for finding new lines of development.…
Spin dynamics of a cluster of coupled spins 1/2 can be manipulated to store and process a large amount of information. A new type of dynamic response makes it possible to excite coherent long-living signals, which can be used for exchanging…
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…