Related papers: A New Monte Carlo Method and Its Implications for …
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…
Elastic systems that are spatially heterogeneous in their mechanical response pose special challenges for molecular simulations. Standard methods for sampling thermal fluctuations of a system's size and shape proceed through a series of…
Although the nonequilibrium relaxation (NER) method has been widely used in Monte Carlo studies on phase transitions in classical spin systems, such studies have been quite limited in quantum phase transitions. The reason is that relaxation…
Hamiltonian Monte Carlo is a widely used algorithm for sampling from posterior distributions of complex Bayesian models. It can efficiently explore high-dimensional parameter spaces guided by simulated Hamiltonian flows. However, the…
We propose a Monte Carlo sampler from the reverse diffusion process. Unlike the practice of diffusion models, where the intermediary updates -- the score functions -- are learned with a neural network, we transform the score matching…
With Monte Carlo methods, we investigate the universality class of the depinning transition in the two-dimensional Ising model with quenched random fields. Based on the short-time dynamic approach, we accurately determine the depinning…
We investigate in this work a recently proposed diagrammatic quantum Monte Carlo method --- the inchworm Monte Carlo method --- for open quantum systems. We establish its validity rigorously based on resummation of Dyson series. Moreover,…
We propose a modification, based on the RESTART (repetitive simulation trials after reaching thresholds) and DPR (dynamics probability redistribution) rare event simulation algorithms, of the standard diffusion Monte Carlo (DMC) algorithm.…
The "backward simulation" of a stochastic process is defined as the stochastic dynamics that trace a time-reversed path from the target region to the initial configuration. If the probabilities calculated by the original simulation are…
We propose an efficient Monte Carlo algorithm for simulating a ``hardly-relaxing" system, in which many replicas with different temperatures are simultaneously simulated and a virtual process exchanging configurations of these replica is…
The mean shift algorithm is a popular way to find modes of some probability density functions taking a specific kernel-based shape, used for clustering or visual tracking. Since its introduction, it underwent several practical improvements…
Monte Carlo algorithms are a foundational pillar of modern computational science, yet their effective application hinges on a deep understanding of their performance trade offs. This paper presents a critical analysis of the evolution of…
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…
Computer simulations of structure formation in network forming materials (such as amorphous semiconductors, glasses, or fluids containing hydrogen bonds) are challenging. The problem is that large structural changes in the network topology…
This paper introduces a class of Monte Carlo algorithms which are based upon the simulation of a Markov process whose quasi-stationary distribution coincides with a distribution of interest. This differs fundamentally from, say, current…
Conventional Monte Carlo simulations are stochastic in the sense that the acceptance of a trial move is decided by comparing a computed acceptance probability with a random number, uniformly distributed between 0 and 1. Here we consider the…
In this paper, we suggest a novel sampling method for Monte Carlo molecular simulations. In order to perform efficient sampling of molecular systems, it is advantageous to avoid extremely high energy configurations while also retaining the…
Monte Carlo sampling techniques have broad applications in machine learning, Bayesian posterior inference, and parameter estimation. Often the target distribution takes the form of a product distribution over a dataset with a large number…
We propose an improved twist-averaging scheme for quantum Monte Carlo methods that use converged Kohn-Sham or Hartree-Fock orbitals as the reference. This twist-averaging technique is tailored to sample the Brillouin zone of magnetic…
Quantum spin systems with strong geometric restrictions give rise to rich quantum phases such as valence bond solids and spin liquid states. However, the geometric restrictions often hamper the application of sophisticated numerical…