# Rejection-free Monte Carlo algorithms for models with continuous degrees of freedom.

@article{Muoz2003RejectionfreeMC, title={Rejection-free Monte Carlo algorithms for models with continuous degrees of freedom.}, author={Jos{\'e} D. Mu{\~n}oz and Mark A. Novotny and S. J. Mitchell}, journal={Physical review. E, Statistical, nonlinear, and soft matter physics}, year={2003}, volume={67 2 Pt 2}, pages={ 026101 } }

We construct a rejection-free Monte Carlo algorithm for a system with continuous degrees of freedom. We illustrate the algorithm by applying it to the classical three-dimensional Heisenberg model with canonical Metropolis dynamics. We obtain the lifetime of the metastable state following a reversal of the external magnetic field. Our rejection-free algorithm obtains results in agreement with a direct implementation of the Metropolis dynamic and requires orders of magnitude less computational…

## 14 Citations

Efficiency of rejection-free methods for dynamic Monte Carlo studies of off-lattice interacting particles.

- PhysicsPhysical review. E, Statistical, nonlinear, and soft matter physics
- 2009

Theoretically the algorithmic 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) is asymptotically proportional to rho(p+2)/2T-d/2 with the particle density rho and the temperature T.

Efficiency of rejection-free dynamic Monte Carlo methods for homogeneous spin models, hard disk systems, and hard sphere systems.

- Computer SciencePhysical review. E, Statistical, nonlinear, and soft matter physics
- 2006

The efficiency of rejection-free Monte Carlo methods is found to be proportional to exp(constbeta) in the Ising, sqrt[beta] in the classical XY, and beta in the Classical Heisenberg spin systems with inverse temperature beta, regardless of the dimension.

Meaningful timescales from Monte Carlo simulations of particle systems with hard-core interactions

- PhysicsJ. Comput. Phys.
- 2016

Self-Avoiding Random Dynamics on Integer Complex Systems

- Computer ScienceTOMC
- 2013

A new specialized algorithm for equilibrium Monte Carlo sampling of binary-valued systems, which allows for large moves in the state space by constructing self-avoiding walks (SAWs) inThe algorithm has several free parameters, but it is shown that Bayesian optimization can be used to automatically tune them.

Nearly reducible finite Markov chains: Theory and algorithms.

- Computer ScienceThe Journal of chemical physics
- 2021

All of the information required to determine the kinetically relevant transition mechanisms, and to identify the states that have a dominant effect on the global dynamics, can be computed reliably even for computationally challenging models.

Accurate acceleration of kinetic Monte Carlo simulations through the modification of rate constants.

- Computer ScienceThe Journal of chemical physics
- 2010

It is shown that the AS-KMC method can be employed with any KMC model, even when no time scale separation is present (although in such cases no computational speed-up is observed), without requiring the knowledge of various time scales present in the system.

Large-Flip Importance Sampling

- Computer ScienceUAI
- 2007

A new Monte Carlo algorithm for complex discrete distributions motivated by the N-Fold Way, which is an ingenious event-driven MCMC sampler that avoids rejection moves at any specific state.

Monte Carlo integration in discrete undirected probabilistic models

- Computer Science
- 2008

It is proved that tree sampling exhibits lower variance than the naive Gibbs sampler and other naive partitioning schemes using the theoretical measure of maximal correlation, and it is shown empirically thatTree sampling is considerably more efficient than other partitioned sampling schemes and the naive Goddard sampler, even in cases where loopy belief propagation fails to converge.

Solving the master equation for extremely long time scale calculations

- PhysicsComput. Phys. Commun.
- 2005

Efficient and exact sampling of transition path ensembles on Markovian networks.

- MathematicsThe Journal of chemical physics
- 2020

This work implements two accelerated kMC methods to simulate the nonequilibrium stochastic dynamics on arbitrary Markovian networks, namely, weighted ensemble (THE AUTHORS) sampling and kinetic path sampling (kPS), and demonstrates that they allow for efficient estimation of the time-dependent occupation probability distributions for the metastable macrostates, and of TPE statistics, such as committor functions and first passage time distributions.

## References

SHOWING 1-10 OF 22 REFERENCES

Monte Carlo algorithms with absorbing Markov chains: Fast local algorithms for slow dynamics.

- Computer SciencePhysical review letters
- 1995

A class of Monte Carlo algorithms which incorporate absorbing Markov chains is presented, and it is demonstrated that the higher-order algorithms can be many orders of magnitude faster than either the traditional Monte Carlo or [ital n]-fold way algorithms.

Monte carlo simulation with time step quantification in terms of langevin dynamics

- PhysicsPhysical review letters
- 2000

This model is a simple model for isolated magnetic particles in a uniform field with an oblique angle to the easy axis of the particles, where the characteristic time of the magnetization reversal are in excellent agreement with asymptotic solutions for the Neel-Brown model.

Broad Histogram Method for Continuous Systems : The XY-Model

- Physics
- 1998

We propose a way of implementing the Broad Histogram Monte Carlo method to systems with continuous degrees of freedom, and we apply these ideas to investigate the three-dimensional XY-model with…

Advanced Dynamic Algorithms for the Decay of Metastable Phases in Discrete Spin Models: Bridging Disparate Time Scales

- Physics
- 1999

An overview of advanced dynamical algorithms capable of spanning the widely disparate time scales that govern the decay of metastable phases in discrete spin models is presented. The algorithms…

From Massively Parallel Algorithms and Fluctuating Time Horizons to Non-equilibrium Surface Growth

- Computer SciencePhysical review letters
- 2000

This work studies the asymptotic scaling properties of a massively parallel algorithm for discrete-event simulations where the discrete events are Poisson arrivals and indicates that the algorithm is asymPTotically scalable.

Equation of state calculations by fast computing machines

- Physics
- 1953

A general method, suitable for fast computing machines, for investigating such properties as equations of state for substances consisting of interacting individual molecules is described. The method…

Magnetization switching in a Heisenberg model for small ferromagnetic particles

- Physics
- 1998

We investigate the thermally activated magnetization switching of small ferromagnetic particles driven by an external magnetic field. For low uniaxial anisotropy the spins can be expected to rotate…

Magnetization switching in small ferromagnetic particles: Nucleation and coherent rotation

- Physics
- 1999

The mechanisms of thermally activated magnetization switching in small ferromagnetic particles driven by an external magnetic field are investigated. For low uniaxial anisotropy the spins rotate…

Faster Monte Carlo simulations.

- Computer SciencePhysical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics
- 1995

For Monte Carlo simulations of systems of size [ital M], either kinetic simulations or equilibrium simulations that use the method of Bortz, Kalos, and Liebowitz, the best computer time per event has been [ital O]([ital M][sup 1/2]).