Related papers: Efficient Cluster Algorithm for CP(N-1) Models
In this work we experimentally study the efficiency of various dynamical decoupling sequences for suppressing decoherence of single as well as multiple quantum coherences on large spin-clusters. The system involves crystallites of a…
Spin systems with frustration and disorder are notoriously difficult to study both analytically and numerically. While the simulation of ferromagnetic statistical mechanical models benefits greatly from cluster algorithms, these accelerated…
Recent developments of high-order CCM have been to extend existing formalism and codes to $s \ge \frac 12$ for both the ground and excited states, and independently to "generalised" expectation values for a wide range of one- and two-body…
In sensor networks, it is not always practical to set up a fusion center. Therefore, there is need for fully decentralized clustering algorithms. Decentralized clustering algorithms should minimize the amount of data exchanged between…
An efficient O(N) cluster Monte Carlo method for Ising models with long-range interactions is presented. Our novel algorithm does not introduce any cutoff for interaction range and thus it strictly fulfills the detailed balance. The…
For Majorana-Wilson lattice fermions in two dimensions we derive a dimer representation. This is equivalent to Gattringer's loop representation, but is made exact here on the torus. A subsequent dual mapping leads to yet another…
Using a dual representation of lattice fermion models that is based on spin-charge transformation and fermionisation of the original description, I derive an algorithm for diagrammatic Monte Carlo simulation of strongly correlated systems.…
We describe a number of recently developed cluster-flipping algorithms for the efficient simulation of classical spin models near their critical temperature. These include the algorithms of Wolff, Swendsen and Wang, and Niedermeyer, as well…
We propose a cluster simulation algorithm for statistical ensembles with fixed order parameter. We use the tethered ensemble, which features Helmholtz's effective potential rather than Gibbs's free energy, and in which canonical averages…
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…
This paper presents a new clustering algorithm for symmetric positive semi-definite (SPSD) matrices, called K-Tensors. The method identifies structured subsets of the SPSD cone characterized by common principal component (CPC)…
With the membership function being strictly positive, the conventional fuzzy c-means clustering method sometimes causes imbalanced influence when clusters of vastly different sizes exist. That is, an outstandingly large cluster drags to its…
We consider the design of a non-local MonteCarlo algorithm for $SU(3)$ lattice systems according to the idea of {\em embedding} the degrees of freedom corresponding to the center of the group $Z(3)$. As a crucial ingredient to reach this…
A new approximate scheme, DSUB$m$, is described for the coupled cluster method. We then apply it to two well-studied (spin-1/2 Heisenberg antiferromagnet) spin-lattice models, namely: the $XXZ$ and the $XY$ models on the square lattice in…
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…
The coupled cluster method (CCM) is a method of quantum many-body theory that may provide accurate results for the ground-state properties of lattice quantum spin systems even in the presence of strong frustration and for lattices of…
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…
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…
This paper presents a systematic study of the application of convolutional neural networks (CNNs) as an efficient and versatile tool for the analysis of critical and low-temperature phase states in spin system models. The problem of…
We review briefly the fundamental equations of a semi-microscopic core-particle coupling method that makes no reference to an intrinsic system of coordinates. We then demonstrate how an intrinsic system can be introduced in the strong…