Related papers: Rejection-free Geometric Cluster Algorithm for Com…
We calculate the efficiency of a rejection-free dynamic Monte Carlo method for $d$-dimensional off-lattice homogeneous particles interacting through a repulsive power-law potential $r^{-p}$. Theoretically we find the algorithmic efficiency…
We construct asymptotic arguments for the relative efficiency of rejection-free Monte Carlo (MC) methods compared to the standard MC method. We find that the efficiency is proportional to $\exp{({const} \beta)}$ in the Ising, $\sqrt{\beta}$…
In this paper a Monte-Carlo method for simulating the motion of fluid flow moving along a solid wall is proposed. The random vortex method in the present paper is established by using the reflection technology and perturbation technique.…
We present an extension of the semi-grandcanonical (SGC) ensemble that we refer to as the variance-constrained semi-grandcanonical (VC-SGC) ensemble. It allows for transmutation Monte Carlo simulations of multicomponent systems in…
Equilibrium sampling of the configuration space in disordered systems requires algorithms that bypass the glassy slowing down of the physical dynamics. Irreversible Monte Carlo algorithms breaking detailed balance successfully accelerate…
A method is proposed to handle the sign problem in the simulation of systems having indefinite or complex-valued measures. In general, this new approach, which is based on renormalisation blocking, is shown to yield statistical errors…
A simple reweighting scheme is proposed for Monte Carlo simulations of interacting particle systems, permitting one to study various parameter values in a single study, and improving efficiency by an order of magnitude. Unlike earlier…
We introduce a powerful Monte Carlo (MC) algorithm for the atomistic simulation of bulk models of oligo- and poly-thiophenes by redesigning MC moves originally developed for considerably simpler polymer structures and architectures, such as…
We present a new and general Monte Carlo iteration method for generalized ensembles. It consists of two elements: (1) a simple algorithm to distinguish between distributions arising from respectively equilibrium- and non-equilibrium…
Generalized rules for building and flipping clusters in the quantum Monte Carlo loop algorithm are presented for the XXZ-model in a uniform magnetic field along the Z-axis. As is demonstrated for the Heisenberg antiferromagnet it is…
We present cluster Monte Carlo algorithms for the $XYZ$ quantum spin models. In the special case of $S=1/2$, the new algorithm can be viewed as a cluster algorithm for the 8-vertex model. As an example, we study the $S=1/2$ $XY$ model in…
We present a nonlocal Monte Carlo algorithm with particle swaps that greatly accelerates thermalization of soft sphere binary mixtures in the glassy region. Our first results show that thermalization of systems of hundreds of particles is…
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 construct a rejection-free Monte Carlo algorithm for a system with continuous degrees of freedom. We illustrate the algorithm by applying it to the classical three-dimensional Heisenberg model with canonical Metropolis dynamics. We…
Computing systems interacting with real-world processes must safely and reliably process uncertain data. The Monte Carlo method is a popular approach for computing with such uncertain values. This article introduces a framework for…
Complex soft matter systems can be efficiently studied with the help of adaptive resolution simulation methods, concurrently employing two levels of resolution in different regions of the simulation domain. The non-matching properties of…
We introduce a Monte-Carlo algorithm for the simulation of charged particles moving in the continuum. Electrostatic interactions are not instantaneous as in conventional approaches, but are mediated by a constrained, diffusing electric…
We present a new type of cluster algorithm that strongly reduces critical slowing down in simulations of vertex models. Since the clusters are closed paths of bonds, we call it the {\em loop algorithm}. The basic steps in constructing a…
We introduce a natural way to extend celebrated spin-cluster Monte Carlo algorithms for fast thermal lattice simulations at criticality, like Wolff, to systems in arbitrary fields, be they linear magnetic vector fields or nonlinear…
Granular material is showing very often in geotechnical engineering, petroleum engineering, material science and physics. The packings of the granular material play a very important role in their mechanical behaviors, such as stress-strain…