Related papers: Transition Matrix Cluster Algorithms
We demonstrate that a temperature schedule for single-spin flip transition matrix calculations can be simply and rapidly generated by monitoring the average size of the Wolff clusters at a set of discrete temperatures. Optimizing this…
In any valid Monte Carlo sampling that realizes microcanonical property we can collect statistics for a transition matrix in energy. This matrix is used to determine the density of states, from which most of the thermodynamical averages can…
An efficient approach to calculate approximate pure-state and transition reduced density matrices in the framework of the multireference relativistic Fock-space coupled cluster (FS CC) theory is proposed. The method is based on the…
In this paper, we present a cluster algorithm for the simulation of hard spheres and related systems. In this algorithm, a copy of the configuration is rotated with respect to a randomly chosen pivot point. The two systems are then…
A comparison between single-cluster and single-spin algorithms is made for the Ising model in 2 and 3 dimensions. We compare the amount of computer time needed to achieve a given level of statistical accuracy, rather than the speed in terms…
We show that addition of Metropolis single spin-flips to the Wolff cluster flipping Monte Carlo procedure leads to a dramatic {\bf increase} in performance for the spin-1/2 Ising model. We also show that adding Wolff cluster flipping to the…
We present a progress report on the Cluster Processor, a special-purpose computer system for the Wolff simulation of the three-dimensional Ising model, including an analysis of simulation results obtained thus far. These results allow,…
We present an algorithm which calculates groundstates of Ising spin glasses approximately. It works by randomly selecting clusters of spins which exhibit no frustrations. The spins which were not selected, contribute to the local fields of…
The principle and the efficiency of the Monte Carlo transfer-matrix algorithm are discussed. Enhancements of this algorithm are illustrated by applications to several phase transitions in lattice spin models. We demonstrate how the…
In computer vision, the estimation of the fundamental matrix is a basic problem that has been extensively studied. The accuracy of the estimation imposes a significant influence on subsequent tasks such as the camera trajectory…
We present an efficient algorithm for twirling a multi-qudit quantum state. The algorithm can be used for approximating the twirling operation in an ensemble of physical systems in which the systems cannot be individually accessed. It can…
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…
Creating low dimensional representations of a high dimensional data set is an important component in many machine learning applications. How to cluster data using their low dimensional embedded space is still a challenging problem in…
We propose a Fourier-based approach for optimization of several clustering algorithms. Mathematically, clusters data can be described by a density function represented by the Dirac mixture distribution. The density function can be smoothed…
We develop and test cluster approximations, which generalize simple mean--field by taking into account more and more local correlations, for the Totally Asymmetric Simple Exclusion Process with open boundaries. We consider in detail the…
Although histogram methods have been extremely effective for analyzing data from Monte Carlo simulations, they do have certain limitations, including the range over which they are valid and the difficulties of combining data from…
We present a formalism of the transition matrix Monte Carlo method. A stochastic matrix in the space of energy can be estimated from Monte Carlo simulation. This matrix is used to compute the density of states, as well as to construct…
A cluster density matrix is introduced in the form suitable for the self-consistent calculation of relevant thermodynamic averages for the Ising model with spin S=1/2. On this basis, derivation of the Gibbs free-energy for the effective…
We present a novel framework exploiting the cascade of phase transitions occurring during a simulated annealing of the Expectation-Maximisation algorithm to cluster datasets with multi-scale structures. Using the weighted local covariance,…
Cluster molecular field approximations represent a substantial progress over the simple Weiss theory where only one spin is considered in the molecular field resulting from all the other spins. In this work we discuss a systematic way of…