Related papers: Cluster simulations of loop models on two-dimensio…
Motivated by the prospect of quantum simulation of quantum field theories, we formulate the $O(N)$ nonlinear sigma model as a "qubit" model with an $(N+1)$-dimensional local Hilbert space at each lattice site. Using an efficient worm…
Unsupervised machine learning is one of the main techniques employed in artificial intelligence. We introduce an algorithm for quantum-assisted unsupervised data clustering using the self-organizing feature map, a type of artificial neural…
A spin-1 Blume-Capel model with dilute and random crystal fields is examined for honeycomb and square lattices by introducing an effective-field approximation that takes into account the correlations between different spins that emerge when…
Cluster Monte Carlo algorithms are widely regarded as the most effective route to overcoming critical slowing down in lattice spin systems. Whether this acceleration persists in the presence of vacancies and multicritical fluctuations,…
We consider general classes of lattice clusters, including various kinds of animals and trees on different lattices. We prove that if a given local configuration ("pattern") of sites and bonds can occur in large clusters, then it occurs at…
The phase diagram of the quantum dimer model on the hexagonal (honeycomb) lattice is computed numerically, extending on earlier work by Moessner, Sondhi, and Chandra. The different ground state phases are studied in detail using several…
We present an enhanced off-lattice kinetic Monte Carlo (OLKMC) model, based on a new method for tolerant classification of atomistic local-environments that is invariant under Euclidean-transformations and permutations of atoms. Our method…
We introduce in this paper two dimensional lattice models whose continuum limit belongs to the $N=2$ series. The first kind of model is integrable and obtained through a geometrical reformulation, generalizing results known in the $k=1$…
A new Monte Carlo algorithm for 2-dimensional spin glasses is presented. The use of clusters makes possible global updates and leads to a gain in speed of several orders of magnitude. As an example, we study the 2-dimensional +/-J…
A family of models for fluctuating loops in a two dimensional random background is analyzed. The models are formulated as O(n) spin models with quenched inhomogeneous interactions. Using the replica method, the models are mapped to the…
The computational complexity of internal diffusion-limited aggregation (DLA) is examined from both a theoretical and a practical point of view. We show that for two or more dimensions, the problem of predicting the cluster from a given set…
The thermodynamics of the O(N) model in 1+1 dimensions is studied applying the CJT formalism and the auxiliary field method as well as fully nonperturbative finite temperature lattice simulations. The numerical results for the renormalized…
A review of the coupled cluster method (CCM) applied to lattice quantum spin systems is presented here. The CCM formalism is explained and an application to the spin-half {\it XXZ} model on the square lattice is presented. Low orders of…
Clustering algorithms are one of the main analytical methods to detect patterns in unlabeled data. Existing clustering methods typically treat samples in a dataset as points in a metric space and compute distances to group together similar…
We present a detailed description of the generalized geometric cluster algorithm for the efficient simulation of continuum fluids. The connection with well-known cluster algorithms for lattice spin models is discussed, and an explicit full…
Monte Carlo simulation using a cluster algorithm is used to compute the scaling part of the free energy for a three dimensional O(4) spin model. The results are relevant for analysis of lattice studies of high temperature QCD.
This review gives an overview on the research of algorithms for dynamical fermions used in large scale lattice QCD simulations. First a short overview on the state-of-the-art of ensemble generation at the physical point is given. Followed…
We present a fine-grained approach to identify clusters and perform percolation analysis in a 2D lattice system. In our approach, we develop an algorithm based on the linked-list data structure whereby the members of a cluster are nodes of…
Linked cluster expansions are generalized from an infinite to a finite volume on a $d$-dimensional hypercubic lattice. They are performed to 20th order in the expansion parameter to investigate the phase structure of scalar $O(N)$ models…
Cluster synchronization in synthetic networks of coupled chaotic oscillators is investigated. It is found that despite the asymmetric nature of the network structure, a subset of the oscillators can be synchronized as a cluster while the…