Related papers: A cluster algorithm for Monte Carlo simulations of…
The behavior of a Lattice Monte Carlo algorithm (if it is designed correctly) must approach that of the continuum system that it is designed to simulate as the time step and the mesh step tend to zero. However, we show for an algorithm for…
A cluster Monte Carlo method for systems of classical spins with purely dipolar couplings is presented. It is tested and applied for finite arrays of perpendicular Ising dipoles on the triangular lattice. This model is a modification with…
The swap Monte Carlo algorithm introduces non-physical dynamic rules to accelerate the exploration of the configuration space of supercooled liquids. Its success raises deep questions regarding the nature and physical origin of the slow…
We introduce an algorithm to systematically improve the efficiency of parallel tempering Monte Carlo simulations by optimizing the simulated temperature set. Our approach is closely related to a recently introduced adaptive algorithm that…
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 developed a technique to determine suitable spin models for small embedded clusters of arbitrary geometry by combining the spin-cluster expansion with the relativistic disordered local moment scheme. We present results for uncovered and…
Recently, a diffusion Monte Carlo algorithm was applied to the study of spin dependent interactions in condensed matter. Following some of the ideas presented therein, and applied to a Hamiltonian containing a Rashba-like interaction, a…
We develop a biased Monte Carlo algorithm to measure probabilities of rare events in cluster-cluster aggregation for arbitrary collision kernels. Given a trajectory with a fixed number of collisions, the algorithm modifies both the waiting…
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…
Population annealing Monte Carlo is an efficient sequential algorithm for simulating k-local Boolean Hamiltonians. Because of its structure, the algorithm is inherently parallel and therefore well suited for large-scale simulations of…
Dilute dipolar Ising magnets remain a notoriously hard problem to tackle both analytically and numerically because of long-ranged interactions between spins as well as rare region effects. We study a new type of anisotropic dilute dipolar…
Ab initio Monte Carlo simulations have been performed to determine the equilibrium properties of liquid lithium and lithium clusters at different temperatures. First-principles density-functional methods were employed to calculate the…
Monte Carlo algorithms are barely considered in spin foam quantum gravity. Due to the quantum nature of spin foam amplitudes one cannot readily apply them, and the present sign problem is a threat to convergence and thus efficiency. Yet,…
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 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…
We present and analyze a micro/macro acceleration technique for the Monte Carlo simulation of stochastic differential equations (SDEs) in which there is a separation between the (fast) time-scale on which individual trajectories of the SDE…
In Monte Carlo simulations with a local update algorithm, the auto-correlation with respect to the topological charge tends to become very long. In the extreme case one can only perform reliable measurements within fixed sectors. We…
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 investigate the applicability of the synchronous relaxation (SR) algorithm to parallel kinetic Monte Carlo simulations of simple models of thin-film growth. A variety of techniques for optimizing the parallel efficiency are also…
We outline the steps needed in to calibrate the Monte Carlo code in order to perform large scale simulations of real globular clusters. We calibrate the results against $N$-body simulations for $N = 2500$, 10000 and for the old open cluster…