Related papers: Embedding Z(3) in SU(3)
In online clustering problems, there is often a large amount of uncertainty over possible cluster assignments that cannot be resolved until more data are observed. This difficulty is compounded when clusters follow complex distributions, as…
We propose a new Monte Carlo algorithm for the numerical study of general lattice models in Hamiltonian form. The algorithm is based on an initial Ansatz for the ground state wave function depending on a set of free parameters which are…
An overview is given over the recently developed and now widely used Monte Carlo algorithms with reduced or eliminated critical slowing down. The basic techniques are overrelaxation, cluster algorithms and multigrid methods. With these…
The simulation of strongly correlated electron systems remains a formidable challenge. Certain experimentally relevant dynamical response functions are especially difficult to calculate, due to issues of finite-size effects and the ill…
We present an algorithmic framework for a variant of the quantum Monte Carlo operator-loop algorithm, where non-local cluster updates are constructed in a way that makes each individual loop smaller. The algorithm is designed to increase…
We examine methods for clustering in high dimensions. In the first part of the paper, we perform an experimental comparison between three batch clustering algorithms: the Expectation-Maximization (EM) algorithm, a winner take all version of…
We have simulated the three-dimensional Heisenberg model on simple cubic lattices, using the single-cluster Monte Carlo update algorithm. The expected pronounced reduction of critical slowing down at the phase transition is verified. This…
We present a novel Monte Carlo algorithm which enhances equilibrization of low-temperature simulations and allows sampling of configurations over a large range of energies. The method is based on a non-Boltzmann probability weight factor…
We apply the coupled cluster method (CCM) to the Hamiltonian version of the latticised O(4) non-linear sigma model. The method, which was initially developed for the accurate description of quantum many-body systems, gives rise to two…
We present a detailed description of the idea and procedure for the newly proposed Monte Carlo algorithm of tuning the critical point automatically, which is called the probability-changing cluster (PCC) algorithm [Y. Tomita and Y. Okabe,…
We propose a new class of robust and Fisher-consistent estimators for mixture models. These estimators can be used to construct robust model-based clustering procedures. We study in detail the case of multivariate normal mixtures and…
We present an exact Monte Carlo algorithm designed to sample theories where the energy is a sum of many couplings of decreasing strength. The algorithm avoids the computation of almost all non-leading terms. Its use is illustrated by…
We introduce a new Monte Carlo method for pure gauge theories. It is not intended for use with dynamical fermions. It belongs to the class of Local Hybrid Monte Carlo (LHMC) algorithms, which make use of the locality of the action by…
Quantum simulations of the dynamics of QCD have been limited by the complexities of mapping the continuous gauge fields onto quantum computers. By parametrizing the gauge invariant Hilbert space in terms of plaquette degrees of freedom, we…
We study the design of efficient approximation algorithms for the $\ell$-center clustering and minimum-diameter $\ell$-clustering problems in high dimensional Euclidean and Hamming spaces. Our main tool is randomized dimension reduction.…
In this work we study the Hubbard model on a bi-partite lattice using the coupled-cluster method (CCM). We first investigate what, within this approach, allows us to reproduce the zero order parameter in the 1D model, as predicted by the…
We present our investigation of SU(2) gauge theory with 8 flavours, and SU(3) gauge theory with 12 flavours. For the SU(2) case, at strong bare coupling, $\beta \lesssim 1.45$, the distribution of the lowest eigenvalue of the Dirac operator…
The emergence of scanning probe and electron beam imaging techniques have allowed quantitative studies of atomic structure and minute details of electronic and vibrational structure on the level of individual atomic units. These microscopic…
We show that any lattice in $\mathrm{SL}_3(k)$, where $k$ is a nonarchimedean local field, contains an undistorted subgroup isomorphic to the free product $\mathbb{Z}^2*\mathbb{Z}$. To our knowledge, the subgroups we construct give the…
We present a version of the domino shuffling algorithm (due to Elkies, Kuperberg, Larsen and Propp) which works on a different lattice: the hexagonal lattice superimposed on its dual graph. We use our algorithm to count perfect matchings on…