Related papers: Event-chain Monte Carlo for classical continuous s…
In this paper we present the event-chain algorithms, which are fast Markov-chain Monte Carlo methods for hard spheres and related systems. In a single move of these rejection-free methods, an arbitrarily long chain of particles is…
We extend the event-chain Monte Carlo algorithm from hard-sphere interactions to the micro-canonical ensemble (constant potential energy) for general potentials. This event-driven Monte Carlo algorithm is non-local, rejection-free, and…
We design an enhanced Event-Chain Monte Carlo algorithm to study 1D quantum dissipative systems, using their bosonized representation. Expressing the bosonized Hamiltonian as a path integral over a scalar field enables the application of…
We generalize the rejection-free event-chain Monte Carlo algorithm from many particle systems with pairwise interactions to systems with arbitrary three- or many-particle interactions. We introduce generalized lifting probabilities between…
Event-chain Monte Carlo (ECMC) accelerates the sampling of hard-sphere systems, and has been generalized to the potentials used in classical molecular simulation. Rather than imposing detailed balance on transition probabilities, the method…
We discuss the rejection-free event-chain Monte-Carlo algorithm and several applications to dense soft matter systems. Event-chain Monte-Carlo is an alternative to standard local Markov-chain Monte-Carlo schemes, which are based on detailed…
We combine parallelization and cluster Monte Carlo for hard sphere systems and present a parallelized event chain algorithm for the hard disk system in two dimensions. For parallelization we use a spatial partitioning approach into…
In this paper we present a dynamical Monte Carlo algorithm which is applicable to systems satisfying a clustering condition: during the dynamical evolution the system is mostly trapped in deep local minima (as happens in glasses, pinning…
We analyze the convergence of the irreversible event-chain Monte Carlo algorithm for continuous spin models in the presence of topological excitations. In the two-dimensional XY model, we show that the local nature of the Markov-chain…
We present an algorithm for the simulation of the exact real-time dynamics of classical many-body systems with discrete energy levels. In the same spirit of kinetic Monte Carlo methods, a stochastic solution of the master equation is found,…
We propose an efficient Monte Carlo algorithm for the off-lattice simulation of dense hard sphere polymer melts using cluster moves, called event chains, which allow for a rejection-free treatment of the excluded volume. Event chains also…
We apply the event-chain Monte Carlo algorithm to the three-dimensional ferromagnetic Heisenberg model. The algorithm is rejection-free and also realizes an irreversible Markov chain that satisfies global balance. The autocorrelation…
An efficient Monte Carlo algorithm for the simulation of spin models with long-range interactions is discussed. Its central feature is that the number of operations required to flip a spin is independent of the number of interactions…
A new Monte Carlo algorithm for 2-dimensional spin glasses is presented. The use of clusters makes possible global updates and leads to a gain in speed of several orders of magnitude. As an example, we study the 2-dimensional +/-J…
We have developed an efficient Monte Carlo algorithm, which accelerates slow Monte Carlo dynamics in quasi-one-dimensional Ising spin systems. The loop algorithm of the quantum Monte Carlo method is applied to the classical spin models with…
We study the phase transition of the classical $XY$ model on a diamond lattice by Monte Carlo simulations using the Wolff cluster algorithm. Finite-size scaling (FSS) analysis of the Binder cumulant and the second-moment correlation length…
In this article, we present an event-driven algorithm that generalizes the recent hard-sphere event-chain Monte Carlo method without introducing discretizations in time or in space. A factorization of the Metropolis filter and the concept…
Recently a cluster Monte Carlo algorithm has been used very successfully in the two-dimensional Edwards-Anderson (EA) model. We show that this algorithm and a variant thereof can also be used successfully in models with a non-zero spin…
Monte Carlo simulations are widely employed to measure the physical properties of glass-forming liquids in thermal equilibrium. Combined with local Monte Carlo moves, the Metropolis algorithm can also be used to simulate the relaxation…
An efficient Quantum Monte Carlo algorithm for the simulation of bosonic systems on a lattice in a grand canonical ensemble is proposed. It is based on the mapping of bosonic models to the spin models in the limit of the infinite total spin…