相关论文: Cluster Monte Carlo algorithms for diluted spin gl…
An extensive equilibrium Monte Carlo simulation is performed on the 3D isotropic Heisenberg SG model with the random nearest-neighbor Gaussian coupling, with particular interest in its chiral-glass (CG) and spin-glass (SG) orderings. For…
We have argued in recent papers that Monte Carlo results for the equilibrium properties of the Edwards-Anderson spin glass in three dimensions, which had been interpreted earlier as providing evidence for replica symmetry breaking, can be…
We extend the Wolff algorithm to include correlated spin interactions in diluted magnetic systems. This algorithm is applied to study the site-bond-correlated Ising model on a two dimensional square lattice. We use a finite size scaling…
An efficient O(N) cluster Monte Carlo method for Ising models with long-range interactions is presented. Our novel algorithm does not introduce any cutoff for interaction range and thus it strictly fulfills the detailed balance. The…
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…
We review the local Monte Carlo dynamics and Swendsen-Wang cluster algorithm. We introduce and analyze a new Monte Carlo dynamics known as transitional Monte Carlo. The transitional Monte Carlo algorithm samples energy probability…
We discuss the status of Monte Carlo simulations of (mainly finite dimensional) spin glass systems. After a short historical note and a brief theoretical introduction we start by discussing the (crucial) 3D case: the warm phase, the…
Computational codes based on the Diffusion Monte Carlo method can be used to determine the quantum state of two-electron systems confined by external potentials of various nature and geometry. In this work, we show how the application of…
We present molecular dynamics (MD) simulations results for dense fluids of ultrasoft, fully-penetrable particles. These are a binary mixture and a polydisperse system of particles interacting via the generalized exponential model, which is…
We develop a generic strategy and simple numerical models for multi-component metallic glasses for which the swap Monte Carlo algorithm can produce highly stable equilibrium configurations equivalent to experimental systems cooled more than…
We present results from Monte Carlo simulations of the two- and three-dimensional gauge glass at low temperature using the parallel tempering Monte Carlo method. Our results in two dimensions strongly support the transition being at T_c=0.…
A new cluster algorithm based on invasion percolation is described. The algorithm samples the critical point of a spin system without a priori knowledge of the critical temperature and provides an efficient way to determine the critical…
The Widom-Rowlinson model of a fluid mixture is studied using a new cluster algorithm that is a generalization of the invaded cluster algorithm previously applied to Potts models. Our estimate of the critical exponents for the two-component…
The invaded cluster algorithm, a new method for simulating phase transitions, is described in detail. Theoretical, albeit nonrigorous, justification of the method is presented and the algorithm is applied to Potts models in two and three…
We propose a novel computational strategy to study the glass transition of molecular fluids. Our approach combines the construction of simple yet realistic models with the development of Monte Carlo algorithms to accelerate equilibration…
Monodisperse ensembles of particles that have cluster crystalline phases at low temperatures can model a number of physical systems, such as vortices in type-1.5 superconductors, colloidal suspensions and cold atoms. In this work we study a…
We present an algorithm for the simulation of three-dimensional spin glasses deep in the low-temperature phase: Parallel Tempering enhanced with Houdayer moves and with an entropic reservoir (PTHR). Although differences with the standard…
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…
An efficient approach of measuring the absolute free energy in parallel tempering Monte Carlo using the exponential averaging method is discussed and the results are compared with those of population annealing Monte Carlo using the…
Monte Carlo algorithms are frequently used in atomistic simulations, including for computation of magnetic parameter temperature dependences in multiscale simulations. Even though parallelization strategies for Monte Carlo simulations of…