Related papers: Cluster Monte Carlo algorithms for diluted spin gl…
Coupled cluster theory is a vital cornerstone of electronic structure theory and is being applied to ever-larger systems. Stochastic approaches to quantum chemistry have grown in importance and offer compelling advantages over traditional…
We introduce two novel quantum Monte Carlo methods and employ them to study the superfluid-insulator transition in a two-dimensional system of hard-core bosons. One of the methods is appropriate for zero temperature and is based upon…
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…
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…
A worm algorithm is proposed for the two-dimensional spin glasses. The method is based on a low-temperature expansion of the partition function. The low-temperature configurations of the spin glass on square lattice can be viewed as strings…
We investigate dynamic scaling properties of the two-dimensional gauge glass model for the vortex glass phase in superconductors with quenched disorder. From extensive Monte Carlo simulations we obtain static and dynamic finite size scaling…
Spin-glasses are Gibbs distributions that have been studied in CS for many decades. Recently, they have gained renewed attention as they emerge naturally in learning, inference, optimisation etc. We consider the Edwards-Anderson (EA)…
The study of the low temperature phase of spin glass models by means of Monte Carlo simulations is a challenging task, because of the very slow dynamics and the severe finite size effects they show. By exploiting at the best the…
The invaded cluster algorithm is used to study the XY model in two and three dimensions up to sizes 2000^2 and 120^3 respectively. A soft spin O(2) model, in the same universality class as the 3D XY model, is also studied. The static…
The results of numerical simulation using a modified Monte Carlo method with a heat bath algorithm for the pseudospin model of cuprates are presented. The temperature phase diagrams are constructed for various degrees of doping and for…
We introduce a new update scheme to systematically improve the efficiency of parallel tempering simulations. We show that by adapting the number of sweeps between replica exchanges to the canonical autocorrelation time, the average…
We present a novel, generally applicable Monte Carlo algorithm for the simulation of fluid systems. Geometric transformations are used to identify clusters of particles in such a manner that every cluster move is accepted, irrespective of…
Extensive equilibrium Monte Carlo simulations are performed for a three-dimensional Heisenberg spin glass with the nearest-neighbor Gaussian coupling to investigate its spin-glass and chiral-glass orderings. The occurrence of a…
Cluster analysis faces two problems in high dimensions: first, the `curse of dimensionality' that can lead to overfitting and poor generalization performance; and second, the sheer time taken for conventional algorithms to process large…
Recently, Velazquez and Curilef have proposed a methodology to extend Monte Carlo algorithms based on canonical ensemble, which is aimed to overcome slow sampling problems associated with temperature-driven discontinuous phase transitions.…
A quantum-thermal annealing method using a cluster-flip algorithm is studied in the two-dimensional spin-glass model. The temperature (T) and the transverse field (Gamma) are decreased simultaneously with the same rate along a linear path…
Global optimization is an active area of research in atomistic simulations, and many algorithms have been proposed to date. A prominent example is basin hopping Monte Carlo, which performs a modified Metropolis Monte Carlo search to explore…
We present an efficient and exact Monte Carlo algorithm to simulate reversible aggregation of particles with dedicated binding sites. This method introduces a novel data structure of dynamic bond tree to record clusters and sequences of…
We study a generalized clock model on the simple cubic lattice. The parameter of the model can be tuned such that the amplitude of the leading correction to scaling vanishes. In the main part of the study we simulate the model with $Z_8$…
We discuss the efficiency of Monte Carlo methods in solving continuum radiative transfer problems. The sampling of the radiation field and convergence of dust temperature calculations in the case of optically thick clouds are both studied.…