Related papers: Event-chain Monte Carlo with factor fields
The linked cell list algorithm is an essential part of molecular simulation software, both molecular dynamics and Monte Carlo. Though it scales linearly with the number of particles, there has been a constant interest in increasing its…
The particle Gibbs (PG) sampler is a Markov Chain Monte Carlo (MCMC) algorithm, which uses an interacting particle system to perform the Gibbs steps. Each Gibbs step consists of simulating a particle system conditioned on one particle path.…
Computational modeling of contact is fundamental to many engineering applications, yet accurately and efficiently solving complex contact problems remains challenging. In this work, we propose a new contact algorithm that computes contact…
In this paper we study from a numerical analysis perspective the Fractional Step Kinetic Monte Carlo (FS-KMC) algorithms proposed in [1] for the parallel simulation of spatially distributed particle systems on a lattice. FS-KMC are…
Particle-in-cell (PIC) simulations with Monte-Carlo collisions are used in plasma science to explore a variety of kinetic effects. One major problem is the long run-time of such simulations. Even on modern computer systems, PIC codes take a…
We propose the clock Monte Carlo technique for sampling each successive chain step in constant time. It is built on a recently proposed factorized transition filter and its core features include its O(1) computational complexity and its…
We perform Monte Carlo simulations of a simplified two-dimensional model for colloidal hard spheres in an external uniaxial AC electric field. Experimentally, the external field induces dipole moments in the colloidal particles, which in…
The efficiency of Monte Carlo samplers is dictated not only by energetic effects, such as large barriers, but also by entropic effects that are due to the sheer volume that is sampled. The latter effects appear in the form of an entropic…
We consider the Monte-Carlo first visit algorithm, of which the goal is to find the optimal control in a Markov decision process with finite state space and finite number of possible actions. We show its convergence when the discount factor…
The dual-fermion approach provides a formally exact prescription for calculating properties of a correlated electron system in terms of a diagrammatic expansion around dynamical mean-field theory (DMFT). Most practical implementations,…
We present a new class of interacting Markov chain Monte Carlo algorithms for solving numerically discrete-time measure-valued equations. The associated stochastic processes belong to the class of self-interacting Markov chains. In contrast…
Various kinetic Monte Carlo algorithms become inefficient when some of the population sizes in a system are large, which gives rise to a large number of reaction events per unit time. Here, we present a new acceleration algorithm based on…
The small magnitude and long-range character of non-covalent interactions pose a significant challenge for computational quantum chemical and electronic-structure methods alike. State-of-the-art coupled cluster (CC) theory and…
Coulomb collisions in particle simulations for weakly coupled plasmas are modeled by the Landau-Fokker-Planck equation, which is typically solved by Monte-Carlo (MC) methods. One of the main disadvantages of MC is the timestep accuracy…
With the developed "extended Monte Calro" (EMC) algorithm, we have studied the depinning transition in Ising-type lattice models by extensive numerical simulations, taking the random-field Ising model with a driving field and the driven…
We present a novel saturation and leading order collinear factorization based Monte-Carlo implementation of the EKRT model for computing QCD matter initial states in high-energy nuclear collisions. As new features the MC implementation…
We applied a multicanonical algorithm (entropic sampling) to a two-dimensional and a three-dimensional Lennard-Jones system with quasicrystalline and glassy ground states. Focusing on the ability of the algorithm to locate low lying energy…
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 use a large cell Monte Carlo Renormalization procedure, to compute the critical exponents of a system of growing linear polymers. We simulate the growth of non-intersecting chains in large MC cells. Dense regions where chains get in each…
We study the Hubbard model using the Cellular Dynamical Mean-Field Theory (CDMFT) with quantum Monte Carlo (QMC) simulations. We present the algorithmic details of CDMFT with the Hirsch-Fye QMC method for the solution of the…