Related papers: Efficient predecision scheme for Metropolis Monte …
Monte Carlo (MC) simulations are essential computational approaches with widespread use throughout all areas of science. We present a method for accelerating lattice MC simulations using fully connected and convolutional artificial neural…
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…
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…
We propose a fast potential splitting Markov Chain Monte Carlo method which costs $O(1)$ time each step for sampling from equilibrium distributions (Gibbs measures) corresponding to particle systems with singular interacting kernels. We…
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…
We develop a direct diagrammatic Monte Carlo framework for the Renyi entanglement entropy of interacting lattice fermions. The method starts from the fermionic graded-swap representation of Z_n[A]=Tr_A\rho_A^n, which converts the entropy…
We apply a new entropic scheme to study the critical behavior of the square-lattice Ising model with nearest- and next-nearest-neighbor antiferromagnetic interactions. Estimates of the present scheme are compared with those of the…
We present here the systematic development of quantitative lattice simulations of dense polymers through a novel computational technique that allows for an efficient accounting of the chain conformations. Our approach is based on the…
Lattice simulations are an important class of problems in crystalline solids, surface science, alloys, adsorption, absorption, separation, catalysis, to name a few. We describe a fast computational method for performing lattice…
Many spin systems affected by critical slowing down can be efficiently simulated using cluster algorithms. Where such systems have long-range interactions, suitable formulations can additionally bring down the computational effort for each…
The basic idea of fast Monte Carlo (MC) simulations is to perform particle-based MC simulations with the excluded-volume interactions modeled by "soft" repulsive potentials that allow particle overlapping. This gives much faster system…
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 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 propose a new class of interacting Markov chain Monte Carlo (MCMC) algorithms designed for increasing the efficiency of a modified multiple-try Metropolis (MTM) algorithm. The extension with respect to the existing MCMC literature is…
Self-learning Monte Carlo method [arXiv:1610.03137, 1611.09364] is a powerful general-purpose numerical method recently introduced to simulate many-body systems. In this work, we implement this method in the framework of determinantal…
The aim of this work is to prove that it is possible to realise an optical system which produces as output a light intensity that can be expressed in the same mathematical form of the spin glass Hamiltonian. The optical system under study…
Using a dual representation of lattice fermion models that is based on spin-charge transformation and fermionisation of the original description, I derive an algorithm for diagrammatic Monte Carlo simulation of strongly correlated systems.…
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…
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…
A grand canonical Monte Carlo (MC) algorithm is presented for studying the lattice gas model (LGM) of multiple protein sequence alignment, which coherently combines long-range interactions and variable-length insertions. MC simulations are…