[BOOK][B] Markov chain Monte Carlo simulations and their statistical analysis: with web-based Fortran code

BA Berg - 2004 - books.google.com
This book teaches modern Markov chain Monte Carlo (MC) simulation techniques step by
step. The material should be accessible to advanced undergraduate students and is suitable …

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

A Chatterjee, AF Voter - The Journal of chemical physics, 2010 - pubs.aip.org
We present a novel computational algorithm called the accelerated superbasin kinetic
Monte Carlo (AS-KMC) method that enables a more efficient study of rare-event dynamics …

The Monte Carlo method in science and engineering

JG Amar - Computing in science & engineering, 2006 - ieeexplore.ieee.org
Since 1953, researchers have applied the Monte Carlo method to a wide range of areas.
Specialized algorithms have also been developed to extend the method's applicability and …

[HTML][HTML] Nearly reducible finite Markov chains: Theory and algorithms

DJ Sharpe, DJ Wales - The Journal of Chemical Physics, 2021 - pubs.aip.org
Finite Markov chains, memoryless random walks on complex networks, appear commonly
as models for stochastic dynamics in condensed matter physics, biophysics, ecology …

[HTML][HTML] Accelerated kinetic Monte Carlo: A case study; vacancy and dumbbell interstitial diffusion traps in concentrated solid solution alloys

K Ferasat, YN Osetsky, AV Barashev… - The Journal of …, 2020 - pubs.aip.org
Vacancy and self-interstitial atomic diffusion coefficients in concentrated solid solution alloys
can have a non-monotonic concentration dependence. Here, the kinetics of monovacancies …

Efficient and exact sampling of transition path ensembles on Markovian networks

DJ Sharpe, DJ Wales - The Journal of Chemical Physics, 2020 - pubs.aip.org
The problem of flickering trajectories in standard kinetic Monte Carlo (kMC) simulations
prohibits sampling of the transition path ensembles (TPEs) on Markovian networks …

Self-avoiding random dynamics on integer complex systems

F Hamze, Z Wang, N De Freitas - ACM Transactions on Modeling and …, 2013 - dl.acm.org
This article introduces a new specialized algorithm for equilibrium Monte Carlo sampling of
binary-valued systems, which allows for large moves in the state space. This is achieved by …

Microstructure and velocity of field-driven solid-on-solid interfaces moving under stochastic dynamics with local energy barriers

GM Buendía, PA Rikvold, M Kolesik - Physical Review B—Condensed Matter …, 2006 - APS
We study the microscopic structure and the stationary propagation velocity of (1+ 1)-
dimensional solid-on-solid interfaces in an Ising lattice-gas model, which are driven far from …

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

H Watanabe, S Yukawa, MA Novotny, N Ito - Physical Review E—Statistical …, 2006 - APS
We construct asymptotic arguments for the relative efficiency of rejection-free Monte Carlo
(MC) methods compared to the standard MC method. We find that the efficiency is …

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

ML Guerra, MA Novotny, H Watanabe, N Ito - Physical Review E—Statistical …, 2009 - APS
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 …