Related papers: A cluster algorithm for Monte Carlo simulations of…
Merging galaxy clusters have become one of the most important probes of dark matter, providing evidence for dark matter over modified gravity and even constraints on the dark matter self-interaction cross-section. To properly constrain the…
The "gravitational million-body problem," to model the dynamical evolution of a self-gravitating, collisional N-body system with ~10^6 particles over many relaxation times, remains a major challenge in computational astrophysics.…
In dynamic Monte Carlo simulations, using for example the Metropolis dynamic, it is often required to simulate for long times and to simulate large systems. We present an overview of advanced algorithms to simulate for larger times and to…
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…
We present an exact Monte Carlo algorithm designed to sample theories where the energy is a sum of many couplings of decreasing strength. The algorithm avoids the computation of almost all non-leading terms. Its use is illustrated by…
Among random sampling methods, Markov Chain Monte Carlo algorithms are foremost. Using a combination of analytical and numerical approaches, we study their convergence properties towards the steady state, within a random walk Metropolis…
The effect of different move sets on the folding kinetics of the Monte Carlo simulations is analysed based on the conformation-network and the temperature-dependent folding kinetics. A new scheme of implementing Metropolis algorithm is…
Zero- and two-dimensional crystal defects form in open statistical ensembles, such as the grand canonical, that are usually inaccessible with conventional simulation techniques. This longstanding challenge is overcome with a new Hamiltonian…
Here we study the statistical properties of two-dimensional spin ice in its ground state by the Monte Carlo simulation method. Using a new sampling algorithm, we show that the short-range ice rule in two dimensions gives rise to long-range…
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 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 present a Monte Carlo method to compute efficiently susceptibilites or covariances of two physical variables. The method relies on a generalization of the exchange cluster algorithm to any model of interacting particles with any $2$-body…
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…
A general scheme for devising efficient cluster dynamics proposed in a previous letter [Phys.Rev.Lett. 72, 1541 (1994)] is extensively discussed. In particular the strong connection among equilibrium properties of clusters and dynamic…
We review Sweeny's algorithm for Monte Carlo simulations of the random cluster model. Straightforward implementations suffer from the problem of computational critical slowing down, where the computational effort per edge operation scales…
The collisional interaction in a Bose condensate represents a non-linearity which in analogy with non-linear optics gives rise to unique quantum features. In this paper we apply a Monte Carlo method based on the positive P…
We propose a cluster simulation algorithm for statistical ensembles with fixed order parameter. We use the tethered ensemble, which features Helmholtz's effective potential rather than Gibbs's free energy, and in which canonical averages…
We describe collective-move Monte Carlo algorithms designed to approximate the overdamped dynamics of self-assembling nanoscale components equipped with strong, short-ranged and anisotropic interactions. Conventional Monte Carlo simulations…
We have recently written a new code to simulate the long term evolution of spherical clusters of stars. It is based on the pioneering Monte Carlo scheme proposed by Henon in the 70's. Our code has been devised in the specific goal to treat…
The study of spin decoherence is often performed by assuming that spin-phonon interactions lead to relaxation at high temperatures, and spin-spin dipolar interactions instead contribute to pure dephasing at low temperatures. This has…