Related papers: Efficient Cluster Algorithm for CP(N-1) Models
Correlation clustering is a technique for aggregating data based on qualitative information about which pairs of objects are labeled 'similar' or 'dissimilar.' Because the optimization problem is NP-hard, much of the previous literature…
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…
We propose a simple and efficient clustering method for high-dimensional data with a large number of clusters. Our algorithm achieves high-performance by evaluating distances of datapoints with a subset of the cluster centres. Our…
We report the results of simulations of the Lebwohl-Lasher model of the nematic-isotropic transition using a new cluster Monte Carlo algorithm. The algorithm is a modification of the Wolff algorithm for spin systems, and greatly reduces…
With the aim of studying the relevance and properties of critical slowing down in Monte Carlo simulations of lattice quantum field theories we carried out a high precision numerical study of the discretised two-dimensional CP^{N-1} model at…
Dynamical decoupling (DD) is a well-known open-loop protocol for suppressing unwanted interactions in a quantum system, thereby drastically extending the coherence time of useful quantum states. In the original framework of evolution…
In this paper, we formulate the problem of inferring a Finite Mixture Model from discrete data as an optimal transport problem with entropic regularization of parameter $\lambda\geq 0$. Our method unifies hard and soft clustering, the…
We study fixed points of the easy-plane $\mathbb{CP}^{N-1}$ field theory by combining quantum Monte Carlo simulations of lattice models of easy-plane SU($N$) superfluids with field theoretic renormalization group calculations, by using…
Clustering algorithms have significantly improved along with Deep Neural Networks which provide effective representation of data. Existing methods are built upon deep autoencoder and self-training process that leverages the distribution of…
We propose an automatable data-driven methodology for robust nonlinear reduced-order modelling from time-resolved snapshot data. In the kinematical coarse-graining, the snapshots are clustered into few centroids representable for the whole…
We propose a cold atom implementation to attain the continuum limit of (1+1)-d CP(N-1) quantum field theories. These theories share important features with (3+1)-d QCD, such as asymptotic freedom and $\theta$ vacua. Moreover, their…
We formulate a novel technique for the detection of functional clusters in discrete event data. The advantage of this algorithm is that no prior knowledge of the number of functional groups is needed, as our procedure progressively combines…
We study the properties of the Wang-Swendsen-Kotecky cluster Monte Carlo algorithm for simulating the 3-state kagome-lattice Potts antiferromagnet at zero temperature. We prove that this algorithm is not ergodic for symmetric subsets of the…
By means of lattice calculations, center vortices have been established as the infrared dominant gauge field configurations of Yang-Mills theory. In this work, we investigate an ensemble of center vortices in D = 3 Euclidean space-time…
We study the high-dimensional linear regression problem with categorical predictors that have many levels. We propose a new estimation approach, which performs model compression via two mechanisms by simultaneously encouraging (a)…
We report on the development of two dual worm constructions that lead to cluster algorithms for efficient and ergodic Monte Carlo simulations of frustrated Ising models with arbitrary two-spin interactions that extend up to third-neighbours…
Clustering is a fundamental problem in unsupervised machine learning with many applications in data analysis. Popular clustering algorithms such as Lloyd's algorithm and $k$-means++ can take $\Omega(ndk)$ time when clustering $n$ points in…
Quantum link models provide an extension of Wilson's lattice gauge theory in which the link Hilbert space is finite-dimensional and corresponds to a representation of an embedding algebra. In contrast to Wilson's parallel transporters,…
We have designed a new multi-scale approach for Strongly Correlated Systems by combining the Dynamical Cluster Approximation (DCA) and the recently introduced dual-fermion formalism. This approach employs an exact mapping from a real…
We present a fast and robust cluster update algorithm that is especially efficient in implementing the task of image segmentation using the method of superparamagnetic clustering. We apply it to a Potts model with spin interactions that are…